Lower Bounds for Conjunctive and Disjunctive Turing Kernels.
Elisabet BurjonsPeter RossmanithPublished in: IPEC (2021)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound algorithm
- branch and bound
- np hard
- kernel function
- upper and lower bounds
- lower and upper bounds
- quadratic assignment problem
- machine intelligence
- lower bounding
- worst case
- optimal solution
- graph kernels
- randomly generated problems
- support vector
- vc dimension
- max sat
- set of randomly generated instances
- kernel methods
- closely related
- feature space
- answer sets
- linear programming relaxation
- concept class
- linear combination
- turing machine
- special case
- polynomial approximation