Descriptive complexity of linear equation systems and applications to propositional proof complexity

Article Details
Title:	Descriptive complexity of linear equation systems and applications to propositional proof complexity
Article URLs:	https://doi.org/10.1109/LICS.2017.8005081 http://doi.ieeecomputersociety.org/10.1109/LICS.2017.8005081
Alternative Article URLs:
Authors:	Martin Grohe	RWTH Aachen University
Authors:	Wied Pakusa	University of Oxford
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/lics/GroheP17
Author Comments:

ACM/IEEE Logic in Computer Science, LICS 2017