7 Hits in 6.0 sec

Even Delta-Matroids and the Complexity of Planar Boolean CSPs [article]

Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek
2018 arXiv   pre-print
As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec.  ...  Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples  ...  Even Delta-Matroids and the Complexity of Planar Boolean CSPs 0:11 where the edge labeling f is marked by thick (1) and thin (0) half-edges.  ... 
arXiv:1602.03124v6 fatcat:6th6pzubtnbjdklulum6drnomi

Introduction to the Special Issue on SODA 2017

Dániel Marx, Virgi Vassilevska Williams, Neal E. Young
2019 ACM Transactions on Algorithms  
In "Even Delta-Matroids and the Complexity of Planar Boolean CSPs," Alexandr Kazda, Vladimir Kolmogorov, and Michal Rolínek study Boolean Constraint Satisfaction Problems (CSPs) under the restriction that  ...  The main result is new tractable class of such CSPs: if all constraints are even Δ-matroids, then the problem is solvable in polynomial time.  ...  In "Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes," Stephan Kreutzer, Roman Rabinovich, and Sebastian Siebertz provide improved bounds on the wideness of nowhere dense graph  ... 
doi:10.1145/3319426 fatcat:yysz5fccdfgffgnhml25auzx6y

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231)

Martin Grohe, Venkatesan Guruswami, Stanislav Zivny, Michael Wagner
2018 Dagstuhl Reports  
CSPs constitute a very rich and yet sufficiently manageable class of problems to give a good perspective on general computational phenomena.  ...  Constraint satisfaction has always played a central role in computational complexity theory; appropriate versions of CSPs are classical complete problems for most standard complexity classes.  ...  -The Constraint Satisfaction Problem: Complexity and Approximability From Weak to Strong LP Gaps for all CSPs We study the approximability of constraint satisfaction problems (CSPs) by linear programming  ... 
doi:10.4230/dagrep.8.6.1 dblp:journals/dagstuhl-reports/GroheGZ18 fatcat:3bqo62ly3rgzlnh3bmkvwbuwea

Approximating Holant problems by winding [article]

Colin McQuillan
2013 arXiv   pre-print
The approach combines a sampler for near-assignments of "windable" functions -- using the cycle-unwinding canonical paths technique of Jerrum and Sinclair -- with a bound on the weight of near-assignments  ...  We give an FPRAS for Holant problems with parity constraints and not-all-equal constraints, a generalisation of the problem of counting sink-free-orientations.  ...  But it is a common definition for delta-matroids.  ... 
arXiv:1301.2880v1 fatcat:4xpvaztdcbdtzal4nz6orjjeo4

Dagstuhl Reports, Volume 7, Issue 8, August 2017, Complete Issue [article]

The unique scientific atmosphere and the historic building provided not only all the room we needed for our program and the working groups, but also plenty of opportunities for continued discussions and  ...  On behalf of all participants the organizers want to express their deep gratitude to the entire Dagstuhl staff for their outstanding support and service accompanying this seminar.  ...  Specifically, given a Boolean constraint language Γ and a degree bound ∆, we study the complexity of #CSP ∆ (Γ), which is the problem of counting satisfying assignments to CSP instances with constraints  ... 
doi:10.4230/dagrep.7.8 fatcat:gksmijgk5ff6reblxsqnt33aze

Dagstuhl Reports, Volume 9, Issue 1, January 2019, Complete Issue [article]

Our results are the following: 1) even on edge-weighted directed planar graphs.  ...  There are two ways of defining such conditionals, one using a Boolean version of Bayes rule, and the other more explicit one, as a pair of Boolean events.  ...  Kopelowitz (Section 3.13) considered the complexity of data structures for the set-disjointness problem.  ... 
doi:10.4230/dagrep.9.1 fatcat:m3grhk5hanccbg7oxkhos7kv4e

Formal Methods for Coordinating Multi-Agent Systems (Dagstuhl Seminar 14332) Next Generation Static Software Analysis Tools (Dagstuhl Seminar 14352) Computational Aspects of Fabrication (Dagstuhl Seminar 14361) Augmenting Human Memory-Capture and Recall in the Era of Lifelogging (Dagstuhl Seminar 14362)

Michael Benedikt, Carsten Lutz, Thomas Ågotnes, Nils Bulling, Daniel Kroening, Thomas Reps, Sanjit Seshia, Aditya Thakur, Patrick Cousot, Daniel Kroening, Carsten Sinz, Marc Alexa (+7 others)
2014 Querying and Reasoning Under Expressive Constraints   unpublished
The complexity of Constraint Satisfaction Problems (CSPs) is in multiple ways connected to the theory of databases.  ...  It is still an open problem whether the class of all CSPs over a fixed finite domain exhibits a complexity dichotomy: Feder and Vardi conjectured that all such CSPs are in P or NP-complete.  ...  This talk presents the state of the art on the computational abstraction of 3D shape using planar sections.  ...