Reasons for Hardness in QBF Proof Systems (Q5053061): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/3378665 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3009797996 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:34, 20 March 2024
scientific article; zbMATH DE number 7626546
Language | Label | Description | Also known as |
---|---|---|---|
English | Reasons for Hardness in QBF Proof Systems |
scientific article; zbMATH DE number 7626546 |
Statements
Reasons for Hardness in QBF Proof Systems (English)
0 references
5 December 2022
0 references
proof complexity
0 references
lower bounds
0 references
quantified Boolean formulas
0 references
resolution
0 references