Solving the satisfiability problem through Boolean networks
From MaRDI portal
Recommendations
Cited in
(14)- From additive flowers to additive automata networks
- Fixed points and 2-cycles of synchronous dynamic coloring processes on trees
- Timescales of Boolean satisfiability solver using continuous-time dynamical system
- Zeon and idem-Clifford formulations of Boolean satisfiability
- On the computation of fixed points in Boolean networks
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- Efficient solution of MAX-SAT and SAT via higher order Boltzmann machines
- SAT-based algorithm for finding cycles in a Boolean network
- SIMPLIFYING BOOLEAN NETWORKS
- An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
- Major 2 satisfiability logic in discrete Hopfield neural network
- Application of SAT-approach for solving combinatorial problems
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- Maximum number of fixed points in regulatory Boolean networks
This page was built for publication: Solving the satisfiability problem through Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729721)