THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS

DOI10.1142/S0129054110007258zbMath1192.68436MaRDI QIDQ3569272

Henning Schnoor

Publication date: 18 June 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

On the applicability of Post's lattice ⋮ The complexity of circumscriptive inference in Post's lattice

Cites Work

• Unnamed Item
• Gap-languages and log-time complexity classes
• Circuits, matrices, and nonassociative computation
• The complexity of the descriptiveness of Boolean circuits over different sets of gates
• Satisfiability problems for propositional calculi
• On the Structure of Polynomial Time Reducibility

This page was built for publication: THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS