Into the Square: On the Complexity of Some Quadratic-time Solvable Problems.
Michele BorassiPierluigi CrescenziMichel HabibPublished in: Electron. Notes Theor. Comput. Sci. (2016)
Keyphrases
- computational complexity
- np complete
- decision problems
- problems involving
- special case
- database
- objective function
- benchmark problems
- application domains
- neural network
- semidefinite programming
- solving problems
- bayesian networks
- optimization problems
- worst case
- probabilistic model
- np hard
- practical problems
- genetic algorithm
- difficult problems
- np hardness
- complexity bounds
- computational issues
- polynomial time complexity