scientific article; zbMATH DE number 4061218

MaRDI QIDQ3795666zbMATH OpenFDO

Authors Erich Grädel

Publication date 1988

zbMATH Keywords

alternating Turing machinesBoolean algebras with bounded quantifier alternationsdomino games

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Recommendations

• Domino Games and Complexity
• Simple sentences that are hard to decide
• Domino-tiling games
• Dominoes and the complexity of subclasses of logical theories
• scientific article; zbMATH DE number 3876591

Cited in

(8)

• Dominoes and the complexity of subclasses of logical theories
• The complexity of short two-person games
• A multiparameter analysis of domino tiling with an application to concurrent systems
• Negative Boolean constraints
• The hyper-weak distributive law and a related game in Boolean algebras
• scientific article; zbMATH DE number 3876591 (Why is no real title available?)
• Turing machines with access to history
• Simple sentences that are hard to decide

This page was built for publication:

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