Comparing the power of monadic NP games

DOI10.1007/3-540-60178-3_95MaRDI QIDQ6064292

Ronald Fagin

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

finite graphcolored graphwinning strategyfine leveloriginal game

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On monadic NP vs monadic co-NP
• An application of games to the completeness problem for formalized theories
• Reachability is harder for directed than for undirected finite graphs
• Monadic generalized spectra
• Comparing the Power of Games on Graphs

This page was built for publication: Comparing the power of monadic NP games