Cell-probe lower bounds for the partial match problem.
T. S. JayramSubhash KhotRavi KumarYuval RabaniPublished in: STOC (2003)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- np hard
- optimal solution
- lower bounding
- linear programming relaxation
- upper and lower bounds
- lower and upper bounds
- stem cell
- neural network
- vc dimension
- worst case
- search algorithm
- partial information
- max sat
- special case
- microscopic images
- optimal cost
- randomly generated problems
- machine learning