CAP 2010 - PDF Preprint Papers

CAP 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CAP-2010 Paper

click to vote

CAP
2010

49views Distributed And Parallel Com...» more CAP 2010»

A high-performance algorithm for calculating cyclotomic polynomials

1 years 9 days ago

Download www.cecm.sfu.ca

The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...

Andrew Arnold, Michael B. Monagan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	49	A high-performance algorithm for calculating cyclotomic polynomials	claim
2	45	Parallel sparse polynomial interpolation over finite fields	claim
3	43	Accuracy versus time: a case study with summation algorithms	claim
4	43	Parallel arithmetic encryption for high-bandwidth communications on multicore/GPGPU platforms	claim
5	40	Parallel operations of sparse polynomials on multicores: I. multiplication and Poisson bracket	claim
6	40	Polynomial homotopies on multicore workstations	claim
7	40	Parallel computation of the minimal elements of a poset	claim
8	39	Cache friendly sparse matrix-vector multiplication	claim
9	38	Parallel disk-based computation for large, monolithic binary decision diagrams	claim
10	36	Parallel sparse polynomial division using heaps	claim
11	35	A quantitative study of reductions in algebraic libraries	claim
12	32	Spiral-generated modular FFT algorithms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers