scientific article
From MaRDI portal
Publication:3365840
zbMath1087.68107MaRDI QIDQ3365840
Andrei A. Krokhin, Andrei A. Bulatov, Peter G. Jeavons
Publication date: 13 February 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (15)
Tractability in constraint satisfaction problems: a survey ⋮ Constraint Satisfaction Problems over the Integers with Successor ⋮ The complexity of constraint satisfaction games and QCSP ⋮ Dualities and algebras with a near-unanimity term ⋮ Majority constraints have bounded pathwidth duality ⋮ Closed sets of finitary functions between finite fields of coprime order ⋮ Computational complexity of auditing finite attributes in statistical databases ⋮ The complexity of soft constraint satisfaction ⋮ Closed sets of finitary functions between products of finite fields of coprime order ⋮ Relatively quantified constraint satisfaction ⋮ CSP dichotomy for special triads ⋮ Determining the consistency of partial tree descriptions ⋮ Expansions of abelian square-free groups ⋮ Dualities for Constraint Satisfaction Problems ⋮ The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
This page was built for publication:
