The complexity of disjunctive linear Diophantine constraints

Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet

Type: Preprint

Publication Date: 2018-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.1807.00985

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction	2011	Manuel Bodirsky Peter Jönsson Timo von Oertzen
+	Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction	2010	Manuel Bodirsky Peter Jönsson Timo von Oertzen
+ PDF Chat	Algorithms and Complexity of Difference Logic	2024	Konrad K. Dabrowski Peter Jönsson Sebastian Ordyniak George Osipov
+	The complete classification for quantified equality constraints	2021	Dmitriy Zhuk Barnaby Martin
+ PDF Chat	The complete classification for quantified equality constraints	2023	Dmitriy Zhuk Barnaby Martin Michał Wrona
+	Disjunctive Programming and Its Relation to Integer Programming	2018	Egon Balas
+	The complexity of positive first-order logic without equality	2010	Florent Madelaine Barnaby Martin
+	Discrete Temporal Constraint Satisfaction Problems	2015	Manuel Bodirsky Barnaby Martin Antoine Mottet
+ PDF Chat	The Complexity of Positive First-Order Logic without Equality	2012	Florent Madelaine Barnaby Martin
+	Sperner type theorems and complexity of minimal disjunctive normal forms of monotone boolean functions	1981	H. -D. O. F. Gronau
+	Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three	2008	Barnaby Martin
+	NP-Complete Problems in Linear Algebra	1990	Santhosh R. Sastry Faculty Advisor Jeter
+ PDF Chat	Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy	2021	Joshua Brakensiek Venkatesan Guruswami
+	DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS	1975	Egon Balas
+ PDF Chat	The Complexity of Positive First-order Logic without Equality	2009	Florent Madelaine Barnaby Martin
+	The complexity of Horn fragments of Linear Logic	1994	Max Kanovich
+	Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation	2005	Michael Bauland Elmar Böhler Nadia Creignou Steffen Reith Henning Schnoor Heribert Vollmer
+ PDF Chat	Discrete Temporal Constraint Satisfaction Problems	2018	Manuel Bodirsky Barnaby Martin Antoine Mottet
+	Definable Inapproximability: New Challenges for Duplicator	2018	Albert Atserias Anuj Dawar
+	Definable Inapproximability: New Challenges for Duplicator	2018	Albert Atserias Anuj Dawar

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (10)

Action	Title	Year	Authors
+ PDF Chat	Model theory: an introduction	2003	David Marker
+ PDF Chat	Schaefer's Theorem for Graphs	2015	Manuel Bodirsky Michael Pinsker
+ PDF Chat	Algorithms for the Solution of Systems of Linear Diophantine Equations	1982	Tsu-Wu J. Chou George E. Collins
+	Distance constraint satisfaction problems	2015	Manuel Bodirsky Víctor Dalmau Barnaby Martin Antoine Mottet Michael Pinsker
+	The wonderland of reflections	2015	Libor Barto Jakub Opršal Michael Pinsker
+	Constraint satisfaction and semilinear expansions of addition over the rationals and the reals	2016	Peter Jönsson Johan Thapper
+	A dichotomy theorem for nonuniform CSPs	2017	Andreǐ A. Bulatov
+	The Proof of CSP Dichotomy Conjecture.	2017	Dmitriy Zhuk
+ PDF Chat	Discrete Temporal Constraint Satisfaction Problems	2018	Manuel Bodirsky Barnaby Martin Antoine Mottet
+	A Proof of the CSP Dichotomy Conjecture	2017	Dmitriy Zhuk