Deciding Hadamard equivalence of Hadamard matrices

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1981 English Publisher:Springer Science and Business Media LLCJournal:BIT, volume 21, pages 374-376 (issn: 0006-3835, eissn: 1572-9125,

Copyright policy )

Authors: Colbourn, Charles J.; Colbourn, Marlene J.;

doi: 10.1007/bf01941473

Deciding Hadamard equivalence of Hadamard matrices

- Summary
- Subjects
- Metrics

Abstract

Equivalence of Hadamard matrices can be decided inO(log2n) space, and hence in subexponential time. These resource bounds follow from the existence of small distinguishing sets.

Related Organizations

University of Saskatchewan
Canada

Keywords

21, 374-376 (1981), computational complexity, Analysis of algorithms and problem complexity, Other matrix algorithms, Hadamard matrices, Hadamard equivalence, combinatorial isomorphism problems, Combinatorial aspects of matrices (incidence, Hadamard, etc.)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average