Related papers: Refuting Feder, Kinne and Rafiey
In this paper we prove the Dichotomy Conjecture on the complexity of nonuniform constraint satisfaction problems posed by Feder and Vardi.
In a non-uniform Constraint Satisfaction problem CSP(G), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constraints imposed on specified sets of variables using the…
The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the…
Two conjectures recently proposed by one of the authors are disproved
Bennett, Carbery, and Tao formulated an n-linear analogue of the Kakeya conjecture in R^n. They proved the conjecture except for the endpoint case. We prove the endpoint case.
The original version of the paper claimed to disprove the pseudo-Riemannian Lichnerowicz conjecture of D'Ambra and Gromov. However, the argument contains a crucial sign error in the lines following equation (8).
Constraint satisfaction problems (CSPs) for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might exhibit a complexity dichotomy, P versus NP-complete. A powerful method to…
Recently GM Sofi & SA Shabir [arXive: 1903.01850v2 [math.GM] 6 Mar 2019] made an attempt to prove the Sendov's conjecture. But unfortunately the proof is not correct. In this note, we discuss the fallacy in the proof.
One of the central problems in the study of parametrized constraint satisfaction problems is the Dichotomy Conjecture by T. Feder and M. Vardi stating that the constraint satisfaction problem (CSP) over a fixed, finite constraint language…
Strong refutation of random CSPs is a fundamental question in theoretical computer science that has received particular attention due to the long-standing gap between the information-theoretic limit and the computational limit. This gap is…
We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…
This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify, simplify, and extend parts of the three approaches that have been developed to…
Feder-Vardi conjecture, which proposed that every finite-domain Constraint Satisfaction Problem (CSP) is either in P or it is NP-complete, has been solved independently by Bulatov and Zhuk almost ten years ago. Bodirsky-Pinsker conjecture…
The paper presents a counterexample to the Hodge conjecture.
Schaefer's dichotomy theorem [Schaefer, STOC'78] states that a boolean constraint satisfaction problem (CSP) is polynomial-time solvable if one of six given conditions holds for every type of constraint allowed in its instances. Otherwise,…
We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…
We prove that the Laptev--Safronov conjecture (Comm. Math. Phys., 2009) is false in the range that is not covered by Frank's positive result (Bull. Lond. Math. Soc., 2011). The simple counterexample is adaptable to a large class of…
In this note, we disprove two Romanov type conjectures posed by Chen.
The Feder-Vardi dichotomy conjecture for Constraint Satisfaction Problems (CSPs) with finite templates, confirmed independently by Bulatov and Zhuk, has an extension to certain well-behaved infinite templates due to Bodirsky and Pinsker…
The article provides a counterexample to a conjecture by Blocki-Zwonek.