The provably total search problems of bounded arithmetic (Q3018648): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 10:24, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The provably total search problems of bounded arithmetic |
scientific article |
Statements
The provably total search problems of bounded arithmetic (English)
0 references
27 July 2011
0 references
combinatorial principles
0 references
NP search problems
0 references
bounded arithmetic hierarchy
0 references
reductions between games
0 references
resolution lower bound
0 references
multiparty communication protocols
0 references