Unordered constraint satisfaction games

DOI10.1007/978-3-642-32589-2_9MaRDI QIDQ2912709zbMATH OpenOpenAlexFDO

Authors Lauri Ahlroth, Pekka Orponen

Publication date 25 September 2012

Published in Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32589-2_9

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Complexity of Unordered CNF Games
• Complexity of unordered CNF games
• The complexity of constraint satisfaction games and QCSP
• Mathematical Foundations of Computer Science 2003
• Mathematical Foundations of Computer Science 2004

Cited in

(3)

• Complexity of Unordered CNF Games
• The complexity of constraint satisfaction games and QCSP
• Complexity of unordered CNF games

This page was built for publication: Unordered constraint satisfaction games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912709)