학술논문
Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
Document Type
Conference Paper
Author
Source
In: Leibniz International Proceedings in Informatics, LIPIcs , 31st EACSL Annual Conference on Computer Science Logic, CSL 2023. (Leibniz International Proceedings in Informatics, LIPIcs, 1 February 2023, 252)
Subject
Language
English
ISSN
18688969