Score: 1
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
Published: November 23, 2025 |
arXiv ID: 2511.18639v1
By: Predrag Janičić
Potential Business Impact:
Helps computers solve really hard problems faster.
Business Areas:
Natural Language Processing
Artificial Intelligence, Data and Analytics, Software
We propose a novel approach for the development, analysis, and verification of reductions between NP-complete problems. This method uses the URSA system, a SAT-based constraint solver and incorporates features that distinguish it from existing related systems.
Similar Papers
87%
Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
Logic in Computer Science
Unlocks secrets of hard computer problems.
26 Sep 2025
0
87%
Structural Separation and Semantic Incompatibility in the P vs. NP Problem: Computational Complexity Analysis with Construction Defining Functionality
Logic in Computer Science
Unlocks secrets of hard computer problems.
26 Sep 2025
0
86%
Redundancy rules for MaxSAT
Logic in Computer Science
Makes solving hard computer puzzles easier and faster.
18 Nov 2025
1
Repos / Data Links
Page Count
26 pages
Category
Computer Science:
Logic in Computer Science