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]

Authors

Amir Abboud

This author has not been identified. Look up 'Amir Abboud' in Google

Shon Feller

This author has not been identified. Look up 'Shon Feller' in Google

Oren Weimann

This author has not been identified. Look up 'Oren Weimann' in Google