Descriptive complexity of linear equation systems and applications to propositional proof complexity. Grohe, M. & Pakusa, W. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, pages 1–12, 2017.
Descriptive complexity of linear equation systems and applications to propositional proof complexity [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/lics/GroheP17,
  author    = {Martin Grohe and
               Wied Pakusa},
  title     = {Descriptive complexity of linear equation systems and applications
               to propositional proof complexity},
  booktitle = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
               2017, Reykjavik, Iceland, June 20-23, 2017},
  pages     = {1--12},
  year      = {2017},
  crossref  = {DBLP:conf/lics/2017},
  url       = {https://doi.org/10.1109/LICS.2017.8005081},
  doi       = {10.1109/LICS.2017.8005081},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/lics/GroheP17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0