Buscar
Mostrando ítems 1-1 de 1
Ponencia
Generating partial Hadamard matrices as solutions to a Constraint Satisfaction Problem characterizing cliques
(2017-07)
A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph Gt of Ito’s Hadamard Graph Δ(4t) [9]. The key idea is translating the problem of extending a given clique Cm to a larger ...