Algorithms for solving linear systems over cyclotomic fields

We consider the problem of solving a linear system A x = b over a cyclotomic field. Cyclotomic fields are special in that we can easily find a prime p for which the minimal polynomial m ( z ) for the field factors into a product of distinct linear factors. This makes it possible to develop fast modu...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of symbolic computation Ročník 45; číslo 9; s. 902 - 917
Hlavní autori:	Chen, Liang, Monagan, Michael
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.09.2010
Predmet:	Cyclotomic fields Cyclotomic polynomials Linear systems Modular algorithms Linear systems Cyclotomic polynomials Modular algorithms Cyclotomic fields
ISSN:	0747-7171, 1095-855X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!