Implicit Hitting Set Algorithms for Reasoning Beyond NP.
Paul SaikkoJohannes Peter WallnerMatti JärvisaloPublished in: KR (2016)
Keyphrases
- computational complexity
- orders of magnitude
- theoretical analysis
- computational cost
- genetic algorithm
- nearest neighbour
- lower and upper bounds
- recently developed
- computationally efficient
- small number
- worst case
- simulated annealing
- np complete
- evolutionary algorithm
- lower bound
- machine learning algorithms
- bayesian networks
- times faster
- knowledge base
- learning algorithm
- neural network