A Metastudy of Algorithm Lower Bounds
Algorithms are essential to the field of computer science, and algorithm designers are always searching for the mathematically optimal algorithms. Sherry and Thompson found that improvements to algorithm upper bounds have been steadily decreasing since the 1970s. In this work we aim to discover whet...
Main Author: | Liu, Emily |
---|---|
Other Authors: | Thompson, Neil |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2022
|
Online Access: | https://hdl.handle.net/1721.1/140013 |
Similar Items
-
Algorithms and lower bounds for sparse recovery
by: Price, Eric (Eric C.)
Published: (2011) -
Complexity Lower Bounds from Algorithm Design
by: Williams, R Ryan
Published: (2022) -
Satisfiability Algorithms and Connections between Algorithms and Circuit Lower Bounds
by: Vyas, Nikhil
Published: (2023) -
Algorithms and lower bounds in the streaming and sparse recovery models
by: Do Ba, Khanh
Published: (2012) -
Algorithms and lower bounds in finite automata size complexity
by: Kapoutsis, Christos, 1974-
Published: (2007)