Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus

Pago, Benedikt Thomas (Corresponding author)

Dagstuhl, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
Contribution to a book, Contribution to a conference proceedings

In: 31st EACSL Annual Conference on Computer Science Logic (CSL 2023)
Page(s)/Article-Nr.: 31:1-31:19


  • Department of Mathematics [110000]
  • Mathematical Fundamentals of Computer Science (Logic and Complexity) Teaching and Research Area [117220]