Pages that link to "Item:Q5230346"
From MaRDI portal
The following pages link to Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP (Q5230346):
Displaying 18 items.
- Complexity theory. Abstracts from the workshop held November 11--17, 2018 (Q782965) (← links)
- Average-case rigidity lower bounds (Q2117087) (← links)
- Upper bound for torus polynomials (Q2117095) (← links)
- Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP'' is not contained in P/poly (Q2328311) (← links)
- Nearest neighbor representations of Boolean functions (Q2672259) (← links)
- Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms (Q2701071) (← links)
- (Q5009555) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- (Q5090385) (← links)
- (Q5090396) (← links)
- (Q5091223) (← links)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- Relations and equivalences between circuit lower bounds and karp-lipton theorems (Q5091782) (← links)
- On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
