The provably total search problems of bounded arithmetic (Q3018648): 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.1112/plms/pdq044 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2167477884 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:54, 19 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
