Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/csl/Pago23>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Benedikt_Pago>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.4230%2FLIPIcs.CSL.2023.31>
foaf:homepage	<https://doi.org/10.4230/LIPIcs.CSL.2023.31>
dc:identifier	DBLP conf/csl/Pago23 (xsd:string)
dc:identifier	DOI doi.org%2F10.4230%2FLIPIcs.CSL.2023.31 (xsd:string)
dcterms:issued	2023 (xsd:gYear)
rdfs:label	Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Benedikt_Pago>
swrc:pages	31:1-31:19 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/csl/2023>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/csl/Pago23/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/csl/Pago23>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/csl/csl2023.html#Pago23>
rdfs:seeAlso	<https://doi.org/10.4230/LIPIcs.CSL.2023.31>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/csl>
dc:title	Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document