Pages that link to "Item:Q5275370"
From MaRDI portal
The following pages link to On the NP-Completeness of the Minimum Circuit Size Problem. (Q5275370):
Displaying 16 items.
- Hardness of sparse sets and minimal circuit size problem (Q2019493) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- The Complexity of Complexity (Q2973719) (← 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)
- (Q5091223) (← links)
- (Q5092470) (← links)
- (Q5092472) (← links)
- Circuit lower bounds from NP-hardness of MCSP under turing reductions (Q5092477) (← links)
- (Q5121893) (← links)
- (Q5121895) (← 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)
- One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)
