Tractability in constraint satisfaction problems: a survey (Q271997): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C30 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6570964 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial-time
Property / zbMATH Keywords: polynomial-time / rank
 
Normal rank
Property / zbMATH Keywords
 
dichotomy
Property / zbMATH Keywords: dichotomy / rank
 
Normal rank
Property / zbMATH Keywords
 
tractable language
Property / zbMATH Keywords: tractable language / rank
 
Normal rank
Property / zbMATH Keywords
 
polymorphism
Property / zbMATH Keywords: polymorphism / rank
 
Normal rank
Property / zbMATH Keywords
 
microstructure
Property / zbMATH Keywords: microstructure / rank
 
Normal rank
Property / zbMATH Keywords
 
forbidden pattern
Property / zbMATH Keywords: forbidden pattern / rank
 
Normal rank
Property / zbMATH Keywords
 
relaxation
Property / zbMATH Keywords: relaxation / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DARN! / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ToulBar2 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1009693448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree width and related hypergraph invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The collapse of the bounded width hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems Solvable by Local Consistency Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimality and global consistency of row-convex constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint tightness and looseness versus local and global consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively quantified constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal infinite-valued constraint languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-dichotomies in Constraint Satisfaction Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of equality constraint languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of temporal constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems raised from 2-semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Parameterized by Solution Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conservative constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative constraint satisfaction re-revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Algorithm for Mal'tsev Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of weighted Boolean \#CSP with mixed signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressibility of functions on the boolean domain, with applications to counting CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying approach to temporal constraint reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of maximal constraint languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualities for Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Results on the Algebraic Approach to the CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maltsev Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Theory of Complexity for Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc consistency and friends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction with succinctly specified relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tractability of CSP Classes Defined by Forbidden Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of soft constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building tractable disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree decompositions and tractable queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the realisability of line drawings of curved objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising tractable constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soft arc consistency revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Temporal Planning: Tractability, Extensions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid tractability of valued constraint problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Triangles and Cross-Free Convexity in Discrete Optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all solutions of generalized satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of constraints. An overview of current research themes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new tractable class of constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Majority-Minority Operations are Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Subexponential-Time Complexity of CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: From local to global consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction over connected row-convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Dichotomy for the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Weighted Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors into heterogeneous classes of SAT and CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain permutation reduction for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of Tractable Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint solving via fractional edge covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring, constraint satisfaction, and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Monotone Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and Learnability Arising from Algebras with Few Subpowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Consistency and SAT-Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints, consistency and closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable constraints on ordered domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3365840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSP for binary conservative relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of conservative valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite set of functions with an EXPTIME-complete composition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of several Maltsev conditions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about temporal relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems on Intervals and Lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new line of attack on the dichotomy conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterisation of First-Order Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of <i>k</i>-B<scp>iclique</scp> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Probabilistic Approach to the Dichotomy Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating fractional hypertree width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable structures for constraint satisfaction with truth tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of acyclic and almost acyclic CNF formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction with bounded treewidth revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time–dependent Simple Temporal Networks: Properties and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finite-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certainty closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Valued Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DARN! A weighted constraint solver for RNA motif localization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:24, 11 July 2024

scientific article
Language Label Description Also known as
English
Tractability in constraint satisfaction problems: a survey
scientific article

    Statements

    Tractability in constraint satisfaction problems: a survey (English)
    0 references
    0 references
    0 references
    0 references
    20 April 2016
    0 references
    0 references
    computational complexity
    0 references
    polynomial-time
    0 references
    dichotomy
    0 references
    tractable language
    0 references
    polymorphism
    0 references
    microstructure
    0 references
    forbidden pattern
    0 references
    relaxation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references