Collapsibility in Infinite-Domain Quantified Constraint Satisfaction

DOI10.1007/11874683_13zbMath1225.68095OpenAlexW1549057885MaRDI QIDQ3613338

Manuel Bodirsky, Hubie Chen

Publication date: 12 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11874683_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Applications of universal algebra in computer science (08A70)

Related Items (2)

An initial study of time complexity in infinite-domain constraint satisfaction ⋮ \(\Lambda \)-ultrametric spaces and lattices of equivalence relations

This page was built for publication: Collapsibility in Infinite-Domain Quantified Constraint Satisfaction