Chernoff-type direct product theorems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485477 (Why is no real title available?)
- scientific article; zbMATH DE number 2009963 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- scientific article; zbMATH DE number 5485571 (Why is no real title available?)
- Approximate list-decoding of direct product codes and uniform hardness amplification
- Chernoff-Type Direct Product Theorems
- Key agreement from weak bit agreement
- On Yao's XOR-lemma
- Parallel Repetition of Computationally Sound Protocols Revisited
- Theory of Cryptography
Cited in
(11)- Parallel repetition theorems for interactive arguments
- scientific article; zbMATH DE number 6687761 (Why is no real title available?)
- A probabilistic variant of Chernoff's product formula
- Hardness self-amplification: simplified, optimized, and unified
- Notes on the Chernoff product formula
- Almost optimal bounds for direct product threshold theorem
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
- Direct product hardness amplification
- Chernoff-Type Direct Product Theorems
- Distinguishing distributions using Chernoff information
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification
This page was built for publication: Chernoff-type direct product theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027975)
