Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Claims a proof that CLIQUE is not solvable in polynomial time on deterministic TMs, implying P ≠ NP.
citing papers explorer
-
A Near-Optimal Parallel Algorithm for Finding Matroid Bases
Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
-
On P Versus NP
Claims a proof that CLIQUE is not solvable in polynomial time on deterministic TMs, implying P ≠ NP.