Hardness amplification for real-valued functions
From MaRDI portal
Cites work
- \(k\)-SUM in the sparse regime: complexity and applications
- A complete problem for statistical zero knowledge
- A tight computational indistinguishability bound for product distributions
- Average-case fine-grained hardness
- Boosting and hard-core set construction
- Computational Complexity
- Counting t-cliques: worst-case to average-case reductions and direct interactive proof systems
- Hardness Amplification of Optimization Problems
- Hardness amplification within NP
- Hardness amplification within NP against deterministic algorithms
- Hardness self-amplification: simplified, optimized, and unified
- scientific article; zbMATH DE number 4191094 (Why is no real title available?)
- scientific article; zbMATH DE number 1304313 (Why is no real title available?)
- scientific article; zbMATH DE number 1306886 (Why is no real title available?)
- On uniform amplification of hardness in NP
- On Worst‐Case to Average‐Case Reductions for NP Problems
- On Yao's XOR-lemma
- Pseudorandomness and average-case complexity via uniform reductions
- The average-case complexity of counting cliques in Erdős-Rényi hypergraphs
- The uniform hardcore lemma via approximate Bregman projections
- Using Nondeterminism to Amplify Hardness
- Worst-case to average-case reductions via additive combinatorics
This page was built for publication: Hardness amplification for real-valued functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296748)
