Pages that link to "Item:Q937197"
From MaRDI portal
The following pages link to Hardness hypotheses, derandomization, and circuit complexity (Q937197):
Displaying 10 items.
- Autoreducibility of NP-complete sets under strong hypotheses (Q1745961) (← links)
- Nondeterminisic sublinear time has measure 0 in P (Q1999993) (← links)
- Nonuniform reductions and NP-completeness (Q2158296) (← links)
- Hardness assumptions in the foundations of theoretical computer science (Q2388429) (← links)
- ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
- Nonuniform reductions and NP-completeness (Q3304139) (← links)
- (Q4526985) (← links)
- (Q5207889) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465865) (← links)
- (Q5480947) (← links)