NP search problems in low fragments of bounded arithmetic (Q5294030): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2162177577 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new proof of the weak pigeonhole principle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank | |||
Normal rank | |||
Latest revision as of 12:00, 26 June 2024
scientific article; zbMATH DE number 5170344
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP search problems in low fragments of bounded arithmetic |
scientific article; zbMATH DE number 5170344 |
Statements
NP search problems in low fragments of bounded arithmetic (English)
0 references
9 July 2007
0 references
bounded arithmetic
0 references
search problems
0 references
resolution
0 references
