A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911283417186304 |
|---|---|
| author | Janičić, Predrag |
| author_facet | Janičić, Predrag |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_18639 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems Janičić, Predrag Logic in Computer Science F.2; F.1.3 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. |
| title | A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems |
| topic | Logic in Computer Science F.2; F.1.3 |
| url | https://arxiv.org/abs/2511.18639 |