Pages that link to "Item:Q5167739"

The following pages link to Short PCPs with Projection Queries (Q5167739):

Displaying 21 items.

• On uniformity and circuit lower bounds (Q488049) (← links)
• Local reduction (Q1641001) (← links)
• Local expanders (Q1653336) (← links)
• Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
• Average-case rigidity lower bounds (Q2117087) (← links)
• Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
• Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP'' is not contained in P/poly (Q2328311) (← links)
• Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
• Local Reductions (Q3448833) (← links)
• New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
• (Q4638059) (← links)
• Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
• (Q5005182) (← links)
• On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
• Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
• Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
• (Q5121894) (← links)
• Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
• Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
• Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
• Rigid matrices from rectangular PCPs (Q6491304) (← links)