Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers (Q3604537)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers |
scientific article; zbMATH DE number 5516778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers |
scientific article; zbMATH DE number 5516778 |
Statements
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers (English)
0 references
24 February 2009
0 references
