2016/04/09 by Hiroshi Tsukimoto, Tsukimoto, Hiroshi
Computer Science · #Advanced Algebra and Logic #Constraint Satisfaction and Optimization #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.1604.03462
openalex publication_date 2016/04/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.