Comparing the Power of Games on Graphs
From MaRDI portal
Publication:4366126
DOI10.1002/malq.19970430402zbMath0888.03027OpenAlexW2171521913MaRDI QIDQ4366126
Publication date: 10 May 1998
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19970430402
Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
Comparing the power of monadic NP games ⋮ Verifiable properties of database transactions ⋮ The closure of monadic NP
Cites Work
This page was built for publication: Comparing the Power of Games on Graphs