Login / Signup
The 2-MAXSAT Problem Can Be Solved in Polynomial Time.
Yangjun Chen
Published in:
CoRR (2023)
Keyphrases
</>
upper bound
min sum
special case
worst case
combinatorial optimization
data mining
approximation algorithms
np hardness
database
information retrieval
genetic algorithm
learning algorithm
similarity measure
multi agent
sat solvers