Hadamard matrices of Williamson type: A challenge for computer algebra

DOI10.1016/j.jsc.2007.05.004zbMath1158.13315OpenAlexW1980181148MaRDI QIDQ1006655

Christos Koukouvinos, Ilias S. Kotsireas

Publication date: 25 March 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2007.05.004

zbMATH Keywords

systems of polynomial equationsHadamard matricesgenetic algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Learning and adaptive systems in artificial intelligence (68T05) Computational aspects and applications of commutative rings (13P99)

Related Items

The Hunt for Weighing Matrices of Small Orders, The SAT+CAS method for combinatorial search with applications to best matrices, Applying computer algebra systems with SAT solvers to the Williamson conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hadamard matrices and their applications: progress 2007--2010
• Ideal basis and primary decompositions: case of two variables
• Matrix representations of octonions and their applications
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Hadamard's determinant theorem and the sum of four squares
• Some results on the parametrization of complex Hadamard matrices