A Framework for Solving Turing Kernel (Compression) Lower Bound Problem and Finding Natural Candidate Problems in NP-intermediate.
Weidong LuoPublished in: CoRR (2016)
Keyphrases
- lower bound
- np complete
- search algorithm for solving
- np hard
- combinatorial optimization
- solving complex
- upper bound
- computational complexity
- branch and bound
- compression algorithm
- data compression
- solving problems
- evolutionary algorithm
- probabilistic model
- special case
- search algorithm
- lower and upper bounds
- multiple kernel learning