Deciding Hadamard equivalence of Hadamard matrices

DOI10.1007/BF01941473zbMATH Open0476.65028OpenAlexW2070369241MaRDI QIDQ1159948FDOQ1159948

Authors: Charles J. Colbourn, Marlene J. Colbourn 

Publication date: 1981

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01941473

zbMATH Keywords

computational complexityHadamard matricesHadamard equivalence21, 374-376 (1981)combinatorial isomorphism problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Cites Work

• Title not available (Why is that?)
• Hadamard equivalence via graph isomorphism
• Equivalence of Hadamard matrices
• An algorithm for computing the automorphism group of a Hadamard matrix

Cited In (1)

• Combinatorial analysis (nonnegative matrices, algorithmic problems)

This page was built for publication: Deciding Hadamard equivalence of Hadamard matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159948)