- Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus Benedikt Pago Fri 24 November 2023
- The complexity of the disjunction and existential properties in intuitionistic logic Sam Buss Grigori Mints Sat 12 September 2020
- Monotone Circuit Lower Bounds from Resolution Ankit Garg Mika Gøøs Pritish Kamath Dmitry Sokolov Mon 14 October 2019
Library Size: 13G (3 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
