Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Deciding Hadamard equivalence of Hadamard matrices

From MaRDI portal
Publication:1159948
Jump to:navigation, search

DOI10.1007/BF01941473zbMath0476.65028OpenAlexW2070369241MaRDI QIDQ1159948

Marlene J. Colbourn, Charles 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)


Related Items

Combinatorial analysis (nonnegative matrices, algorithmic problems)



Cites Work

  • Unnamed Item
  • An algorithm for computing the automorphism group of a Hadamard matrix
  • Hadamard equivalence via graph isomorphism
  • Equivalence of Hadamard matrices
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1159948&oldid=13224638"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki