scientific article; zbMATH DE number 7758317
From MaRDI portal
Publication:6084358
DOI10.4230/lipics.approx/random.2020.15MaRDI QIDQ6084358
Shuichi Hirahara, Osamu Watanabe
Publication date: 31 October 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some consequences of non-uniform conditions on uniform classes
- Hardness vs randomness
- Randomness vs time: Derandomization under a uniform assumption
- Pseudorandomness and average-case complexity via uniform reductions
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
- Erratum for
- Curiouser and Curiouser: The Link between Incompressibility and Complexity
- On basing one-way functions on NP-hardness
- Random-Self-Reducibility of Complete Sets
- Circuit minimization problem
- Average-Case Complexity
- Limitations of Hardness vs. Randomness under Uniform Reductions
- Circuit Lower Bounds for Merlin–Arthur Classes
- Key agreement from weak bit agreement
- Average Case Complete Problems
- A Pseudorandom Generator from any One-way Function
- Identifying an honest EXP NP oracle among many
- Unexpected hardness results for Kolmogorov complexity under uniform reductions
- On Basing Size-Verifiable One-Way Functions on NP-Hardness
- Learning algorithms from natural proofs
- Some Results on Average-Case Hardness Within the Polynomial Hierarchy
- On Worst‐Case to Average‐Case Reductions for NP Problems
- Theory of Cryptography
- Pseudorandom generators without the XOR lemma
This page was built for publication:
