Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Asimi, Kristina"'
We introduce the framework of the left-hand side restricted promise constraint satisfaction problem, which includes problems like approximating clique number of a graph. We study the parameterized complexity of problems in this class and provide some
Externí odkaz:
http://arxiv.org/abs/2402.06821
The fixed-template constraint satisfaction problem (CSP) can be seen as the problem of deciding whether a given primitive positive first-order sentence is true in a fixed structure (also called model). We study a class of problems that generalizes th
Externí odkaz:
http://arxiv.org/abs/2205.04787
Autor:
Asimi, Kristina, Barto, Libor
The Promise Constraint Satisfaction Problem (PCSP) is a generalization of the Constraint Satisfaction Problem (CSP) that includes approximation variants of satisfiability and graph coloring problems. Barto [LICS '19] has shown that a specific PCSP, t
Externí odkaz:
http://arxiv.org/abs/2010.04618
Autor:
'Asimi, Kristina
Publikováno v:
Barto, Libor"
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=r3c4b2081b22::a14cf31ce7274f01ceeeb37c9c0036ce
