Zeon and idem-Clifford formulations of Boolean satisfiability
From MaRDI portal
Publication:2274729
Recommendations
Cites work
- A new adjacency matrix for finite graphs
- A spinorial formulation of the maximum clique problem of a graph
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Nilpotent adjacency matrices and random graphs.
- Operator calculus algorithms for multi-constrained paths
- Operator calculus on graphs. Theory and applications in computer science
- Reducibility among combinatorial problems
- Spinorial formulations of graph problems
- The Boolean satisfiability problem in Clifford algebra
- The complexity of theorem-proving procedures
- Zeons, orthozeons, and graph colorings
Cited in
(6)- Zeon matrix inverses and the zeon combinatorial Laplacian
- Zeon and idem-Clifford formulations of hypergraph problems
- New applications of Clifford's geometric algebra
- Spectrally simple zeros of zeon polynomials
- The Boolean satisfiability problem in Clifford algebra
- scientific article; zbMATH DE number 1630006 (Why is no real title available?)
This page was built for publication: Zeon and idem-Clifford formulations of Boolean satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274729)