Lower Bounds for Randomized Exclusive Write PRAMs.
Philip D. MacKenziePublished in: Theory Comput. Syst. (1997)
Keyphrases
- lower bound
- randomized algorithms
- randomized algorithm
- upper bound
- branch and bound
- np hard
- branch and bound algorithm
- quadratic assignment problem
- objective function
- lower and upper bounds
- worst case
- vc dimension
- lagrangian relaxation
- randomly generated problems
- optimal cost
- lower bounding
- linear programming relaxation
- polynomial approximation
- set of randomly generated instances
- data sets
- decision forest
- max sat
- sample complexity
- computational complexity
- optimal solution
- neural network