Constraint Satisfaction with Counting Quantifiers

DOI10.1137/140981332zbMath1392.68206MaRDI QIDQ5256528

Barnaby Martin, Juraj Stacho, Florent R. Madelaine

Publication date: 18 June 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://eprints.mdx.ac.uk/16767/1/WebCSR2014.pdf

zbMATH Keywords

computational complexity; retraction; counting quantifiers; quantified constraint satisfaction

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)