Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable (Q903199)
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: Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable |
scientific article; zbMATH DE number 6526415
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable |
scientific article; zbMATH DE number 6526415 |
Statements
Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable (English)
0 references
5 January 2016
0 references
computational complexity
0 references
proof complexity
0 references
quantified Boolean formulas (QBF)
0 references
resolution
0 references
