The following pages link to (Q5092472):
Displaying 8 items.
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5028364) (← links)
- OR-Toffoli and OR-Peres Reversible Gates (Q5162618) (← links)
- On the NP-Completeness of the Minimum Circuit Size Problem. (Q5275370) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- Constant depth formula and partial function versions of MCSP are hard (Q6654556) (← links)
