A Simplified NP-Complete MAXSAT Problem.
Venkatesh RamanBala RavikumarS. Srinivasa RaoPublished in: Inf. Process. Lett. (1998)
Keyphrases
- np complete
- sat problem
- np hard
- satisfiability problem
- randomly generated
- constraint satisfaction problems
- pspace complete
- computational complexity
- upper bound
- branch and bound algorithm
- sat solvers
- combinatorial optimization
- phase transition
- conjunctive queries
- polynomial time complexity
- max sat
- data complexity
- databases
- np complete problems
- special case
- search algorithm
- database systems
- genetic algorithm
- boolean satisfiability
- fixed parameter tractable
- database