Quantified Equality Constraints

DOI10.1137/080725209zbMath1220.68058OpenAlexW2163162526MaRDI QIDQ5390611

Manuel Bodirsky, Hubie Chen

Publication date: 4 April 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080725209

zbMATH Keywords

computational complexityrelational structurequantified constraint satisfactionomega-categorical structureequality template

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13) Categoricity and completeness of theories (03C35)

Related Items (8)

Quantified Constraint Satisfaction Problem on Semicomplete Digraphs ⋮ The Complexity of Counting Quantifiers on Equality Languages ⋮ Reconstructing the topology of clones ⋮ Quantified Constraints in Twenty Seventeen ⋮ The complexity of counting quantifiers on equality languages ⋮ Tractability of quantified temporal constraints to the max ⋮ The Complexity of Quantified Constraints Using the Algebraic Formulation ⋮ The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation

This page was built for publication: Quantified Equality Constraints