Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹

Lijie Chen 0001, Zhenjian Lu, Xin Lyu 0002, Igor Carboni Oliveira. Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. In Nikhil Bansal, Emanuela Merelli, James Worrell 0001, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference). Volume 198 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

Abstract

Abstract is missing.