Constraint Satisfaction with Counting Quantifiers 2

DOI10.1007/978-3-319-06686-8_20zbMath1407.68230arXiv1312.7605OpenAlexW2950165413MaRDI QIDQ4981164

Juraj Stacho, Barnaby Martin

Publication date: 24 June 2014

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

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

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 (1)

Constraint Satisfaction with Counting Quantifiers

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