bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

Lower Bounds to the Size of Constant-Depth Propositional Proofs Jan Krajiček [github]
Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic Jan Krajíček [github]
The Cook-Reckhow definition Jan Krajicek [github]
An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle Jan Krajíček Pavel Pudlák Alan Woods [github]
ON THE PROOF COMPLEXITY OF THE NISAN-WIGDERSON GENERATOR BASED ON A HARD NPąpcoNP FUNCTION JAN KRAJÍČEK [github]
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic Jan Krajíček [github]

Library Size: 13G (6 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge
[show logs] [hide logs]