TL;DR
This paper introduces an algorithm that transforms 3-SAT problems into algebraic and trigonometric forms to compute the number of solutions, claiming a potentially polynomial complexity.
Contribution
It proposes a novel approach converting logical formulas into algebraic and trigonometric representations to solve 3-SAT problems.
Findings
Algorithm outputs the number of satisfying assignments.
Computational complexity is probably polynomial.
Transforms logical formulas into algebraic and trigonometric forms.
Abstract
This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic formulas. Second, complex trigonometric functions are assigned to the variables in the elementary algebraic formulas, and the sums of the formulas are calculated. The algorithm outputs the number of satisfying assignments. The computational complexity of the algorithm is probably polynomial.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Rough Sets and Fuzzy Logic · Advanced Algebra and Logic