scientific article; zbMATH DE number 7375949
From MaRDI portal
Publication:5002692
DOI10.4230/LIPIcs.ICALP.2018.22zbMath1499.68130MaRDI QIDQ5002692
No author found.
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Quantified Derandomization: How to Find Water in the Ocean ⋮ Cubic Formula Size Lower Bounds Based on Compositions with Majority ⋮ Hardness magnification near state-of-the-art lower bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NP is as easy as detecting unique solutions
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- A method for obtaining more than quadratic effective lower estimates of complexity of \(\pi\) schemes
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Pseudorandom Functions and Lattices
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Pseudorandom Functions and Factoring
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Simple Constructions of Almost k-wise Independent Random Variables
- The Shrinkage Exponent of de Morgan Formulas is 2
- Shrinkage of de Morgan formulae under restriction
- Computational Complexity
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
- Quantum lower bounds by polynomials
- Average-case lower bounds for formula size
- Natural proofs
This page was built for publication:
