Login / Signup

A Critique of Chen's "The 2-MAXSAT Problem Can Be Solved in Polynomial Time".

Tran Duy Anh LeMichael P. ReidyEliot J. Smith
Published in: CoRR (2024)
Keyphrases
  • special case
  • upper bound
  • neural network
  • combinatorial optimization
  • computational complexity
  • evolutionary algorithm
  • database
  • data sets
  • branch and bound algorithm
  • approximation algorithms
  • sat solvers
  • min sum