Pseudo-deterministic query complexity of search problems (Q6892811)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 8128833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudo-deterministic query complexity of search problems |
scientific article; zbMATH DE number 8128833 |
Statements
Pseudo-deterministic query complexity of search problems (English)
0 references
28 November 2025
0 references
Boolean functions
0 references
decision trees
0 references
randomness
0 references
search problems
0 references
pseudo-determinism
0 references
