Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection.
Kaspars BalodisJanis IraidsPublished in: Balt. J. Mod. Comput. (2016)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- optimal solution
- lower and upper bounds
- branch and bound
- np hard
- objective function
- constant factor
- random walk
- object detection
- polynomial approximation
- sample complexity
- worst case
- detection rate
- sufficiently accurate
- lower bounding
- graph representation
- graph mining
- bipartite graph
- automatic detection
- directed graph
- false alarms
- graph structure
- online algorithms
- structured data