Lower Bounds Are Not Easier over the Reals: Inside PH.
Hervé FournierPascal KoiranPublished in: ICALP (2000)
Keyphrases
- lower bound
- upper bound
- concept class
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- optimal solution
- randomly generated problems
- membership queries
- np hard
- lower bounding
- worst case
- quadratic assignment problem
- constraint databases
- learning theory
- sample complexity
- max sat
- polynomial approximation
- set of randomly generated instances