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

Information
References
Discussion
Files

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

Main document file(s):

Similar records

h1

h2

h3

h4

h5

h6

RWTH

Kontakt

RWTH Publications

Allgemeines