@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}
}

{"_id":"S6S9MrMpmoSEe3to5","bibbaseid":"grohe-pakusa-descriptivecomplexityoflinearequationsystemsandapplicationstopropositionalproofcomplexity-2017","downloads":0,"creationDate":"2018-03-18T15:43:37.139Z","title":"Descriptive complexity of linear equation systems and applications to propositional proof complexity","author_short":["Grohe, M.","Pakusa, W."],"year":2017,"bibtype":"inproceedings","biburl":"http://dblp.org/pers/tb2/g/Grohe:Martin","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Martin"],"propositions":[],"lastnames":["Grohe"],"suffixes":[]},{"firstnames":["Wied"],"propositions":[],"lastnames":["Pakusa"],"suffixes":[]}],"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","bibtex":"@inproceedings{DBLP:conf/lics/GroheP17,\n author = {Martin Grohe and\n Wied Pakusa},\n title = {Descriptive complexity of linear equation systems and applications\n to propositional proof complexity},\n booktitle = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}\n 2017, Reykjavik, Iceland, June 20-23, 2017},\n pages = {1--12},\n year = {2017},\n crossref = {DBLP:conf/lics/2017},\n url = {https://doi.org/10.1109/LICS.2017.8005081},\n doi = {10.1109/LICS.2017.8005081},\n timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},\n biburl = {https://dblp.org/rec/conf/lics/GroheP17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Grohe, M.","Pakusa, W."],"key":"DBLP:conf/lics/GroheP17","id":"DBLP:conf/lics/GroheP17","bibbaseid":"grohe-pakusa-descriptivecomplexityoflinearequationsystemsandapplicationstopropositionalproofcomplexity-2017","role":"author","urls":{"Paper":"https://doi.org/10.1109/LICS.2017.8005081"},"metadata":{"authorlinks":{}}},"search_terms":["descriptive","complexity","linear","equation","systems","applications","propositional","proof","complexity","grohe","pakusa"],"keywords":[],"authorIDs":["oWamqdovFccHcFdCZ"],"dataSources":["jS7oF7ycnJjCpQRs7"]}