Hardness and optimality in QBF proof systems modulo NP (Q2118289)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hardness and optimality in QBF proof systems modulo NP |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness and optimality in QBF proof systems modulo NP |
scientific article |
Statements
Hardness and optimality in QBF proof systems modulo NP (English)
0 references
22 March 2022
0 references
QBF
0 references
proof complexity
0 references
simulation
0 references
resolution
0 references
extended Frege
0 references
NP oracles
0 references
optimal proof systems
0 references
strategy extraction
0 references
0 references
0 references
