A characterization of efficiently compilable constraint languages
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 7559127 (Why is no real title available?)
- scientific article; zbMATH DE number 7204563 (Why is no real title available?)
- A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
- A dichotomy for succinct representations of homomorphisms
- A dichotomy theorem for maximum generalized satisfiability problems.
- A dichotomy theorem for nonuniform CSPs
- A proof of CSP dichotomy conjecture
- AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
- An effective dichotomy for the counting constraint satisfaction problem
- Branching Programs and Binary Decision Diagrams
- Communication Complexity
- Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
- Complexity classifications of Boolean constraint satisfaction problems
- Complexity of counting CSP with complex weights
- Complexity of generalized satisfiability counting problems
- Connecting knowledge compilation classes and width parameters
- Decomposable negation normal form
- Enumerating all solutions of a Boolean CSP by non-decreasing weight
- Enumerating homomorphisms
- Graph-Based Algorithms for Boolean Function Manipulation
- Query processing on probabilistic data: a survey
- Size bounds for factorised representations of query results
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side
- The approximability of constraint satisfaction problems
- The complexity of counting homomorphisms seen from the other side
- The complexity of finite-valued CSPs
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The complexity of satisfiability problems
- The complexity of the counting constraint satisfaction problem
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
- Understanding the complexity of \#SAT using knowledge compilation
This page was built for publication: A characterization of efficiently compilable constraint languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902715)
