Hadamard matrices of Williamson type: A challenge for Computer Algebra

Kotsireas, IS; Koukouvinos, C

dc.contributor.author	Kotsireas, IS	en
dc.contributor.author	Koukouvinos, C	en
dc.date.accessioned	2014-03-01T01:30:50Z
dc.date.available	2014-03-01T01:30:50Z
dc.date.issued	2009	en
dc.identifier.issn	0747-7171	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/19640
dc.subject	Genetic algorithms	en
dc.subject	Hadamard matrices	en
dc.subject	Systems of polynomial equations	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.classification	Mathematics, Applied	en
dc.title	Hadamard matrices of Williamson type: A challenge for Computer Algebra	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.jsc.2007.05.004	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.jsc.2007.05.004	en
heal.language	English	en
heal.publicationDate	2009	en
heal.abstract	We describe new families of challenging polynomial systems of equations arising in the construction of Hadamard matrices of Williamson type. These systems depend on a parameter and exhibit a number of symmetries. We demonstrate that Genetic Algorithms form a suitable tool to apply to these systems, for which the traditional Computer Algebra methods seem to be inappropriate. (C) 2008 Elsevier Ltd. All rights reserved.	en
heal.publisher	ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD	en
heal.journalName	Journal of Symbolic Computation	en
dc.identifier.doi	10.1016/j.jsc.2007.05.004	en
dc.identifier.isi	ISI:000264447000006	en
dc.identifier.volume	44	en
dc.identifier.issue	3	en
dc.identifier.spage	271	en
dc.identifier.epage	279	en