Constraint Satisfaction with Counting Quantifiers

DOI10.1007/978-3-642-30642-6_24zbMath1360.68514arXiv1112.2974OpenAlexW2122631741MaRDI QIDQ2907506

Juraj Stacho, Barnaby Martin, Florent R. Madelaine

Publication date: 10 September 2012

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.2974

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Boolean max-co-clones ⋮ Constraint Satisfaction with Counting Quantifiers

This page was built for publication: Constraint Satisfaction with Counting Quantifiers