scientific article; zbMATH DE number 5485525
From MaRDI portal
Publication:3549694
Cited in
(6)- Locality and checkability in wait-free computing
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity
- Locality and checkability in wait-free computing
- Interleaved Group Products
- Garbled circuits as randomized encodings of functions: a primer
- Verifiable stream computation and Arthur-Merlin communication
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549694)