2³ quantified Boolean formula games and their complexities

zbMATH Open1371.91029arXiv1401.3687MaRDI QIDQ2829173FDOQ2829173

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

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

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

Mathematics Subject Classification ID

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

Cited In (3)

• Mathematical Foundations of Computer Science 2003
• Complexity of unordered CNF games
• Quantified Boolean Solving for Achievement 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)