Fine-Grained Complexity and Algorithms for the Schulze Voting Method
Main Authors: | Sornat, Krzysztof, Vassilevska Williams, Virginia, Xu, Yinzhan |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM)
2022
|
Online Access: | https://hdl.handle.net/1721.1/143943 |
Similar Items
-
Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More
by: Chan, Timothy M., et al.
Published: (2023) -
Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
by: Williams, Virginia Vassilevska, et al.
Published: (2021) -
Juergen Schulz (1927-2014)
by: Friedman, David Hodes
Published: (2016) -
Monochromatic Triangles, Triangle Listing and APSP
by: Williams, Virginia Vassilevska, et al.
Published: (2022) -
Fine-grained complexity meets communication complexity
by: Chen, Lijie(Electrical and computer science engineer)Massachusetts Institute of Technology.
Published: (2019)