Pages that link to "Item:Q3604537"
From MaRDI portal
The following pages link to Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers (Q3604537):
Displaying 8 items.
- On the maximum length of coil-in-the-box codes in dimension 8 (Q477349) (← links)
- On cardinalities of \(k\)-abelian equivalence classes (Q728280) (← links)
- On orthogonal symmetric chain decompositions (Q2325764) (← links)
- The maximum length of circuit codes with long bit runs and a new characterization theorem (Q2329405) (← links)
- Snakes, coils, and single-track circuit codes with spread \(k\) (Q2352350) (← links)
- Finding Lean Induced Cycles in Binary Hypercubes (Q3637155) (← links)
- Computer-aided constructions of commafree codes (Q6156641) (← links)
- On orthogonal symmetric chain decompositions (Q6621189) (← links)