Pages that link to "Item:Q5918358"
From MaRDI portal
The following pages link to The non-hardness of approximating circuit size (Q5918358):
Displaying 7 items.
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5028364) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- New insights on the (non-)hardness of circuit minimization and related problems (Q5111269) (← links)
- The strength of non-size increasing computation (Q5178911) (← links)