Login / Signup
Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus.
Benedikt Pago
Published in:
CoRR (2022)
Keyphrases
</>
polynomial hierarchy
polynomial time complexity
polynomial size
computational complexity
bounded treewidth
worst case
finite model theory
np complete
fixed parameter tractable
theorem proving
natural deduction
theorem prover
special case
sequent calculus
proof search
database
database theory
conp complete