On the pseudo-deterministic query complexity of NP search problems (Q6115399)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the pseudo-deterministic query complexity of NP search problems |
scientific article; zbMATH DE number 7711618
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the pseudo-deterministic query complexity of NP search problems |
scientific article; zbMATH DE number 7711618 |
Statements
12 July 2023
0 references
pseudo-determinism
0 references
query complexity
0 references
proof complexity
0 references
On the pseudo-deterministic query complexity of NP search problems (English)
0 references
