The Via Minimization Problem is NP-Complete.
Nicholas J. NaclerioSumio MasudaKazuo NakajimaPublished in: IEEE Trans. Computers (1989)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- constraint satisfaction problems
- objective function
- pspace complete
- conjunctive queries
- computational complexity
- np complete problems
- phase transition
- data complexity
- convex minimization
- conp complete
- regularization term
- scheduling problem
- neural network
- data sources
- evolutionary algorithm
- bounded treewidth
- polynomially solvable
- databases
- polynomial time complexity
- real time