Pages that link to "Item:Q5091779"
From MaRDI portal
The following pages link to Hardness magnification near state-of-the-art lower bounds (Q5091779):
Displaying 15 items.
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Hardness of sparse sets and minimal circuit size problem (Q2019493) (← links)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← 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)
- Hardness magnification near state-of-the-art lower bounds (Q5028364) (← links)
- Relations and equivalences between circuit lower bounds and karp-lipton theorems (Q5091782) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- (Q5092470) (← links)
- (Q5092472) (← links)
- The non-hardness of approximating circuit size (Q5918358) (← links)
- Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)
- Constructive separations and their consequences (Q6566463) (← links)
- One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)