A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT.
Yumeng HeMatan Kotler-BerkowitzHarry LiusonZeyu NiePublished in: CoRR (2024)
Keyphrases
- dynamic programming
- computational complexity
- optimization algorithm
- preprocessing
- worst case
- cost function
- experimental evaluation
- objective function
- strongly polynomial
- segmentation algorithm
- significant improvement
- learning algorithm
- computational cost
- k means
- optimal solution
- np hard
- simulated annealing
- linear programming
- particle swarm optimization
- expectation maximization
- detection algorithm
- matching algorithm