The following pages link to (Q5121895):
Displaying 10 items.
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- (Q5091223) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- Relations and equivalences between circuit lower bounds and karp-lipton theorems (Q5091782) (← links)
- (Q5092472) (← links)
- The non-hardness of approximating circuit size (Q5918358) (← 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)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
