2³ quantified Boolean formula games and their complexities

MaRDI QIDQ2829173zbMATH OpenFDO

Authors Kyle Burke

Publication date 27 October 2016

Published in Integers (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.3687, http://www.emis.de/journals/INTEGERS/papers/p3erdos/p3erdos.Abstract.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial games (91A46)

Recommendations

• Complexity of Unordered CNF Games
• Complexity of unordered CNF games
• Mathematical Foundations of Computer Science 2003
• Quantified Boolean Solving for Achievement Games
• PSPACE-Hardness of some combinatorial games

Cited in

(3)

• Mathematical Foundations of Computer Science 2003
• Quantified Boolean Solving for Achievement Games
• Complexity of unordered CNF games

This page was built for publication: \(2^{3}\) quantified Boolean formula games and their complexities

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