Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.03281 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910949374427136 |
|---|---|
| author | Homer, Paul W. |
| author_facet | Homer, Paul W. |
| contents | Boolean Satisfiability (SAT) problems are expressed as mathematical formulas. This paper presents a matrix representation for these SAT problems.
It shows how to use this matrix representation to get the full set of valid satisfying variable assignments. It proves that this is the set of answers for the given problem and is exponential in size relative to the matrix.
It presents a simple algorithm that utilizes the inverse of each clause to find an intersection for the matrix. This gives a satisfying variable assignment. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_03281 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Inverse Intersections for Boolean Satisfiability Problems Homer, Paul W. Computational Complexity Boolean Satisfiability (SAT) problems are expressed as mathematical formulas. This paper presents a matrix representation for these SAT problems. It shows how to use this matrix representation to get the full set of valid satisfying variable assignments. It proves that this is the set of answers for the given problem and is exponential in size relative to the matrix. It presents a simple algorithm that utilizes the inverse of each clause to find an intersection for the matrix. This gives a satisfying variable assignment. |
| title | Inverse Intersections for Boolean Satisfiability Problems |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2501.03281 |