Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
256 views · Published 8 December 2015 · 48:44 · Indexed 1 November 2026
Channel: Simons Institute for the Theory of Computing · 2015 · Education
Fabrizio Grandoni, IDSIA, University of Lugano Computational Complexity of Low-Polynomial Time Problems https://simons.berkeley.edu/talks/fabrizo-grandoni-2015-12-02
More from this channel
-
35:16
Probabilistic Polynomials and Hamming Nearest Neighbors
-
15:16
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
33:01
Revenue Maximization in Interdependent Value Settings
-
34:31
Algorithmic Bayesian Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions