The following pages link to (Q5875777):
Displaying 9 items.
- Input locality and hardness amplification (Q1946597) (← links)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- (Q5092470) (← links)
- Hardness Amplification Proofs Require Majority (Q5390590) (← links)
- Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)
- Constructive separations and their consequences (Q6566463) (← links)
- One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)
- A direct PRF construction from Kolmogorov complexity (Q6637531) (← links)