Login / Signup

The 2-MAXSAT Problem Can Be Solved in Polynomial Time.

Yangjun Chen
Published in: CSCI (2022)
Keyphrases
  • special case
  • computational complexity
  • upper bound
  • min sum
  • branch and bound algorithm
  • combinatorial optimization
  • genetic algorithm
  • real time
  • information retrieval
  • decision making
  • case study
  • database systems