33 citations · 176 across the 16 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019
The Cook-Reckhow definition
Jan Krajicek
The Cook-Reckhow 1979 paper defined the area of research we now call Proof Complexity. There were earlier papers which contributed to the subject as we understand it today, the mos…
cs.CC2019★ 2 cited
Consistency of circuit lower bounds with bounded theories
Jan Bydzovsky, Jan Krajicek, Igor C. Oliveira
Proving that there are problems in that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are…