We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.
The Boolean SATisfiability Problem in Clifford algebra / Budinich, Marco. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - STAMPA. - (2019), pp. 1-10. [10.1016/j.tcs.2019.03.027]
The Boolean SATisfiability Problem in Clifford algebra
Budinich, Marco
2019-01-01
Abstract
We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
tcs11959_2.pdf
Accesso chiuso
Tipologia:
Documento in Versione Editoriale
Licenza:
Copyright Editore
Dimensione
610.45 kB
Formato
Adobe PDF
|
610.45 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
