scientific article; zbMATH DE number 7087310
From MaRDI portal
Publication:5226195
DOI10.4230/LIPIcs.CCC.2019.0zbMath1414.68009MaRDI QIDQ5226195
No author found.
Publication date: 30 July 2019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Near-optimal pseudorandom generators for constant-depth read-once formulas
- Fourier and circulant matrices are not rigid
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity
- Time-space lower bounds for two-pass learning
- Parity helps to compute majority
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs
- Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
- Relations and equivalences between circuit lower bounds and karp-lipton theorems
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- Imperfect gaps in Gap-ETH and PCPs
This page was built for publication:
