Pages that link to "Item:Q2805512"
From MaRDI portal
The following pages link to Natural Proofs versus Derandomization (Q2805512):
Displaying 19 items.
- Local reduction (Q1641001) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Average-case rigidity lower bounds (Q2117087) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Local Reductions (Q3448833) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- (Q4612482) (← links)
- (Q4638059) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← 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)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- (Q5495772) (redirect page) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)
