MathDB1 problem
- 0 votes0 replies0 views
Quasi-polynomial PHP lower bounds in constant-depth Frege
Quasi-polynomial PHP formalization conjecture. The PHP lower bound might be formalizable in these systems, at least in quasi-polynomial size.
Quasi-polynomial PHP lower bounds in constant-depth Frege
Quasi-polynomial PHP formalization conjecture. The PHP lower bound might be formalizable in these systems, at least in quasi-polynomial size.