Conditional lower bounds for graph sensitivity problems
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Main Author: | Ancona, Bertie(Alberto) |
---|---|
Other Authors: | Virginia Vassilevska Williams. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2019
|
Subjects: | |
Online Access: | https://hdl.handle.net/1721.1/123000 |
Similar Items
-
Algorithms and hardness for diameter in dynamic graphs
by: Williams, Virginia Vassilevska, et al.
Published: (2021) -
Connections between circuit analysis problems and circuit lower bounds
by: Murray, Cody (Cody Daniel)
Published: (2019) -
Reducibility and computational lower bounds for problems with planted sparse structure
by: Brennan, Matthew (Matthew Stewart)
Published: (2018) -
Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs
by: Dalirrooyfard, Mina, et al.
Published: (2022) -
Lower bounds in distributed computing
by: Fan, Rui, 1977-
Published: (2008)