On the Descriptive Complexity of a Simplified Game of Hex

DOI10.1093/JIGPAL/10.2.105MaRDI QIDQ4545013zbMATH OpenOpenAlexFDO

Authors Argimiro Arratia

Publication date 8 August 2002

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/10.2.105

zbMATH Keywords

PSPACEWhex

Mathematics Subject Classification ID

Descriptive complexity and finite models (68Q19)

Recommendations

• Generalized hex and logical characterizations of polynomial space
• A difficulty in particular Shannon-like games
• Complexity of path-forming games
• On the complexity of connection games
• Proofs as Games

Cited in

(4)

• scientific article; zbMATH DE number 6490905 (Why is no real title available?)
• On the complexity of connection games
• Computer Science Logic
• On the Complexity of n-Player Hackenbush

This page was built for publication: On the Descriptive Complexity of a Simplified Game of Hex

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