Sprague-Grundy theory in bounded arithmetic

DOI10.1007/s00153-021-00790-7OpenAlexW3184206548MaRDI QIDQ2118177

Satoru Kuroda

Publication date: 22 March 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-021-00790-7

zbMATH Keywords

bounded arithmeticcombinatorial gamespolynomial spacealternating Turing machine

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Cites Work

• On the complexity of computing winning strategies for finite poset games
• On the complexity of some two-person perfect-information games
• Logical Foundations of Proof Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sprague-Grundy theory in bounded arithmetic