A Satisfiability algorithm based on Simple Spinors of the Clifford algebra of $\mathbb{R}^{n,n}$
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915945086189568 |
|---|---|
| author | Budinich, Marco |
| author_facet | Budinich, Marco |
| contents | We refine the formulation of the Boolean satisfiability problem with $n$ Boolean variables in Clifford algebra ${\cal C}\ell(\mathbb{R}^{n,n})$ [3] and exploit this continuous setting to outline a new unsatisfiability test. This algorithm is not combinatorial and can prove unsatisfiability in polynomial time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_01961 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Satisfiability algorithm based on Simple Spinors of the Clifford algebra of $\mathbb{R}^{n,n}$ Budinich, Marco Mathematical Physics We refine the formulation of the Boolean satisfiability problem with $n$ Boolean variables in Clifford algebra ${\cal C}\ell(\mathbb{R}^{n,n})$ [3] and exploit this continuous setting to outline a new unsatisfiability test. This algorithm is not combinatorial and can prove unsatisfiability in polynomial time. |
| title | A Satisfiability algorithm based on Simple Spinors of the Clifford algebra of $\mathbb{R}^{n,n}$ |
| topic | Mathematical Physics |
| url | https://arxiv.org/abs/2501.01961 |