Communication complexity vs randomness complexity in interactive proofs (Q6864458)
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 8154383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity vs randomness complexity in interactive proofs |
scientific article; zbMATH DE number 8154383 |
Statements
Communication complexity vs randomness complexity in interactive proofs (English)
0 references
3 February 2026
0 references
interactive proof systems
0 references
communication complexity
0 references
hash functions
0 references
pseudo-random generators
0 references
compression
0 references
