"Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs ..."

Benedikt Pago (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CSL.2023.31

access: open

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/csl/Pago23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csl/Pago23
Benedikt Pago:
Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. CSL 2023: 31:1-31:19

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.