Computing Binary Combinatorial Gray Codes via Exhaustive Search with SAT−Solvers
Huvudupphovsmän: | Zinovik, I, Kroening, D, Chebiryak, Y |
---|---|
Materialtyp: | Journal article |
Publicerad: |
2015
|
Liknande verk
Liknande verk
-
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers.
av: Zinovik, I, et al.
Publicerad: (2008) -
An efficient SAT encoding of circuit codes
av: Chebiryak, Y, et al.
Publicerad: (2008) -
Periodic orbits and equilibria in glass models for gene regulatory networks.
av: Zinovik, I, et al.
Publicerad: (2010) -
An Algebraic Algorithm for the Identification of Glass Networks with Periodic Orbits along Cyclic Attractors
av: Zinovik, I, et al.
Publicerad: (2007) -
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems
av: Robert Simon Fong, et al.
Publicerad: (2025-01-01)