Pages that link to "Item:Q5465865"
From MaRDI portal
The following pages link to FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465865):
Displaying 14 items.
- Comparing reductions to NP-complete sets (Q879596) (← links)
- Hardness hypotheses, derandomization, and circuit complexity (Q937197) (← links)
- Pushdown dimension (Q995564) (← links)
- Scaled dimension and the Kolmogorov complexity of Turing-hard sets (Q1015370) (← links)
- Non-uniform reductions (Q1959376) (← links)
- Nondeterminisic sublinear time has measure 0 in P (Q1999993) (← links)
- Hardness assumptions in the foundations of theoretical computer science (Q2388429) (← links)
- A zero-one law for RP and derandomization of AM if NP is not small (Q2389331) (← links)
- Upward separations and weaker hypotheses in resource-bounded measure (Q2465636) (← links)
- Partial bi-immunity, scaled dimension, and NP-completeness (Q2480744) (← links)
- ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
- (Q4526985) (← links)
- (Q5207889) (← links)
- (Q5480947) (← links)