Abstract
Equivalence of Hadamard matrices can be decided in O(log2n) space, and hence in subexponential time. These resource bounds follow from the existence of small distinguishing sets.
Original language | English (US) |
---|---|
Pages (from-to) | 374-376 |
Number of pages | 3 |
Journal | BIT |
Volume | 21 |
Issue number | 3 |
DOIs | |
State | Published - Sep 1981 |
Externally published | Yes |
ASJC Scopus subject areas
- Software
- Computer Networks and Communications
- Computational Mathematics
- Applied Mathematics