The following pages link to (Q5368752):
Displayed 19 items.
- Hardness of sparse sets and minimal circuit size problem (Q2019493) (← links)
- Discrete logarithm and minimum circuit size (Q2404611) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- The Complexity of Complexity (Q2973719) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283) (← links)
- (Q5091223) (← links)
- (Q5092470) (← links)
- (Q5092472) (← links)
- Circuit lower bounds from NP-hardness of MCSP under turing reductions (Q5092477) (← links)
- (Q5111269) (← links)
- (Q5121893) (← links)
- (Q5121895) (← links)
- The non-hardness of approximating circuit size (Q5918358) (← links)
- (Q6084358) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
- The final nail in the coffin of statistically-secure obfuscator (Q6161431) (← links)