Pages that link to "Item:Q5205823"
From MaRDI portal
The following pages link to New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems (Q5205823):
Displayed 7 items.
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
- On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- (Q5092470) (← links)
- The non-hardness of approximating circuit size (Q5918358) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)