On the Fine-Grained Complexity of Parity Problems

Amir Abboud, Shon Feller, Oren Weimann. On the Fine-Grained Complexity of Parity Problems. In Artur Czumaj, Anuj Dawar, Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference). Volume 168 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

@inproceedings{AbboudFW20,
  title = {On the Fine-Grained Complexity of Parity Problems},
  author = {Amir Abboud and Shon Feller and Oren Weimann},
  year = {2020},
  doi = {10.4230/LIPIcs.ICALP.2020.5},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.5},
  researchr = {https://researchr.org/publication/AbboudFW20},
  cites = {0},
  citedby = {0},
  booktitle = {47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)},
  editor = {Artur Czumaj and Anuj Dawar and Emanuela Merelli},
  volume = {168},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-138-2},
}