scientific article; zbMATH DE number 7650416
From MaRDI portal
Publication:5875775
Recommendations
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds
- Circuit size relative to pseudorandom oracles
- scientific article; zbMATH DE number 1689047
- Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
- Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
- On circuit lower bounds from derandomization
- Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates
- Pseudorandom bits and lower bounds for randomized Turing machines
- On pseudorandomness and resource-bounded measure
- Pseudorandom bits for constant depth circuits
Cited in
(16)- Circuit size relative to pseudorandom oracles
- scientific article; zbMATH DE number 1689047 (Why is no real title available?)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization
- scientific article; zbMATH DE number 7561759 (Why is no real title available?)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)
- MCSP is hard for read-once nondeterministic branching programs
- Generation of all randomizations using circuits
- Capturing one-way functions via NP-hardness of meta-complexity
- Impagliazzo's worlds through the Lens of conditional Kolmogorov complexity
- A meta-complexity characterization of quantum cryptography
- Stretching demi-bits and nondeterministic-secure pseudorandomness
- Regularization of low error PCPs and an application to MCSP
- Learning algorithms from circuit lower bounds
- On basing auxiliary-input cryptography on NP-hardness via nonadaptive black-box reductions
- Towards PNP from extended Frege lower bounds
- SAT reduces to the minimum circuit size problem with a random oracle
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 Q5875775)
