Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection.
Kaspars BalodisJanis IraidsPublished in: CoRR (2015)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- optimal solution
- objective function
- lower and upper bounds
- worst case
- np hard
- constant factor
- anomaly detection
- detection method
- linear programming relaxation
- data structure
- bipartite graph
- automatic detection
- lower bounding
- collision detection
- collision avoidance
- graph model
- graph structure
- detection rate
- connected components
- false positives
- detection algorithm
- object detection