The following pages link to (Q4381413):
Displaying 6 items.
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Polynomial time ultrapowers and the consistency of circuit lower bounds (Q2288334) (← links)
- Work for the workers: Advances in engineering mechanics and instruction in France, 1800–1830 (Q3317057) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- A remark on pseudo proof systems and hard instances of the satisfiability problem (Q5109236) (← links)
