QCSP on partially reflexive forests

Barnaby Martin

Type: Preprint

Publication Date: 2011-01-01

Citations: 0

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

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	QCSP on partially reflexive forests	2011	Barnaby Martin
+	QCSP on partially reflexive cycles - the wavy line of tractability	2013	Florent Madelaine Barnaby Martin
+	QCSP on partially reflexive cycles - the wavy line of tractability	2013	Florent Madelaine Barnaby Martin
+ PDF Chat	QCSP on Reflexive Tournaments	2022	Benoît Larose Barnaby Martin Petar Marković Daniël Paulusma Siani Smith Stanislav Živný
+ PDF Chat	QCSP on Partially Reflexive Cycles – The Wavy Line of Tractability	2013	Florent Madelaine Barnaby Martin
+	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
+	Constraint satisfaction problems for reducts of homogeneous graphs	2016	Manuel Bodirsky Barnaby Martin Michael Pinsker András Pongrácz
+	Constraint satisfaction problems for reducts of homogeneous graphs	2016	Manuel Bodirsky Barnaby Martin Michael Pinsker András Pongrácz
+	Constraint Satisfaction Problems for Reducts of Homogeneous Graphs	2019	Manuel Bodirsky Barnaby Martin Michael Pinsker András Pongrácz
+ PDF Chat	Non-negatively Weighted #CSP: An Effective Complexity Dichotomy	2011	Jin‐Yi Cai Xi Chen Pinyan Lu
+ PDF Chat	Quantified Constraints and Containment Problems	2008	Hubie Chen Florent Madelaine Barnaby Martin
+	Quantified Conjunctive Queries on Partially Ordered Sets	2014	Simone Bova Robert Ganian Stefan Szeider
+	Quantified Conjunctive Queries on Partially Ordered Sets	2014	Simone Bova Robert Ganian Stefan Szeider
+	Constraint satisfaction problems for reducts of homogeneous graphs.	2016	Manuel Bodirsky Barnaby Martin Michael Pinsker András Pongrácz
+	A complexity dichotomy for poset constraint satisfaction	2016	Michael Kompatscher Trung Van Pham
+	On the CSP Dichotomy Conjecture	2011	Andreĭ A. Bulatov
+ PDF Chat	$\Pi_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem	2024	Dmitriy Zhuk
+ PDF Chat	Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?	2023	Markus Hecher
+	Pliability and Approximating Max-CSPs	2019	Miguel Romero Marcin Wrochna Stanislav Živný

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors