Name
Abstract | ||
|---|---|---|
The Strong Exponential Time Hypothesis and the OV-conjecture are two popular hardness assumptions used to prove a plethora of lower bounds, especially in the realm of polynomial-time algorithms. The OV-conjecture in moderate dimension states there is no ε>0 for which an O(N2−ε) poly(D) time algorithm can decide whether there is a pair of orthogonal vectors in a given set of size N that contains D-dimensional binary vectors.
We strengthen the evidence for these hardness assumptions. In particular, we show that if the OV-conjecture fails, then two problems for which we are far from obtaining even tiny improvements over exhaustive search would have surprisingly fast algorithms. If the OV conjecture is false, then there is a fixed ε>0 such that:
- For all d and all large enough k, there is a randomized algorithm that takes O(n(1−ε)k) time to solve the Zero-Weight-k-Clique and Min-Weight-k-Clique problems on d-hypergraphs with n vertices. As a consequence, the OV-conjecture is implied by the Weighted Clique conjecture.
- For all c, the satisfiability of sparse TC1 circuits on n inputs (that is, circuits with cn wires, depth clogn, and negation, AND, OR, and threshold gates) can be computed in time O((2−ε)n).
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3188745.3188938 | STOC '18: Symposium on Theory of Computing
Los Angeles
CA
USA
June, 2018 |
Keywords | DocType | Volume |
fine-grained complexity,OV,clique,satisfiability,threshold circuits | Journal | abs/1805.08554 |
ISSN | ISBN | Citations |
0737-8017 | 978-1-4503-5559-9 | 3 |
PageRank | References | Authors |
0.38 | 38 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abboud, A. | 1 | 411 | 25.21 |
| Karl Bringmann | 2 | 147 | 19.84 |
| Holger Dell | 3 | 220 | 16.74 |
| Jesper Nederlof | 4 | 294 | 24.22 |