The following pages link to (Q5368903):
Displaying 12 items.
- Hardness of sparse sets and minimal circuit size problem (Q2019493) (← links)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283) (← links)
- (Q5091223) (← links)
- (Q5092470) (← links)
- (Q5092482) (← links)
- The non-hardness of approximating circuit size (Q5918358) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
