On Planar Boolean CSP (Q3448805)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On Planar Boolean CSP	scientific article

Statements

scholarly article

0 references

On Planar Boolean CSP (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-662-47672-7_35

0 references

Zdeněk Dvořák

0 references

0 references

Automata, Languages, and Programming

0 references

publication date

27 October 2015

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-47672-7_35

0 references

0 references

Constraint Satisfaction Problems of Bounded Width

0 references

The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)

0 references

A dichotomy theorem for constraint satisfaction problems on a 3-element set

0 references

Classifying the Complexity of Constraints Using Finite Algebras

0 references

Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP

0 references

Mathematical Foundations of Computer Science 2003

0 references

Paths, Trees, and Flowers

0 references

Fanout limitations on constraint systems

0 references

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

0 references

The linear delta-matroid parity problem

0 references

The complexity of planar Boolean \#CSP with complex weights

0 references

0 references

Minimum-weight triangulation is NP-hard

0 references

The complexity of satisfiability problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3448805

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3448805&oldid=36208725"