On the computational complexity of finding hard tautologies (Q5402611): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1112/blms/bdt071 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2106792056 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1212.1789 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1112/BLMS/BDT071 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:56, 30 December 2024
scientific article; zbMATH DE number 6270262
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of finding hard tautologies |
scientific article; zbMATH DE number 6270262 |
Statements
On the computational complexity of finding hard tautologies (English)
0 references
14 March 2014
0 references
propositional proof systems
0 references
proof complexity
0 references
Nisan-Wigderson generator
0 references
