Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Proof Complexity of Quantified Boolean Logic — A Survey

From MaRDI portal
Publication:6167165
Jump to:navigation, search

DOI10.1142/9789811245220_0015OpenAlexW4362237097MaRDI QIDQ6167165

Olaf Beyersdorff

Publication date: 4 August 2023

Published in: Mathematics for Computation (M4C) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789811245220_0015



Mathematics Subject Classification ID

Computer science (68-XX)


Related Items (2)

Never trust your solver: certification for SAT and QBF ⋮ Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024







This page was built for publication: Proof Complexity of Quantified Boolean Logic — A Survey

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6167165&oldid=35649023"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 10 July 2024, at 06:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki