Parallel methods for absolute irreducibility testing

Authors:
Fatima K. Abu Salem;Laurence T. Yang
Affiliations:
Computer Science Department, American University of Beirut, Riad El Solh Beirut, Lebanon 1107 2020;Department of Computer Science, St. Francis Xavier University, Antigonish, Canada B2G 2W5
Venue:
The Journal of Supercomputing
Year:
2008

Citing 12
Cited 0

Factoring multivariate polynomials over algebraic number fields

SIAM Journal on Computing
A bridging model for parallel computation

Communications of the ACM
Absolute factorization of polynomials: a geometric approach

SIAM Journal on Computing
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
Computational geometry in C (2nd ed.)

Computational geometry in C (2nd ed.)
BSPlib: The BSP programming library

Parallel Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The function field sieve

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
Factoring multivariate polynomials via partial differential equations

Mathematics of Computation
Parallel Scientific Computation: A Structured Approach Using BSP and MPI

Parallel Scientific Computation: A Structured Approach Using BSP and MPI
Factoring polynomials via polytopes

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
An efficient sparse adaptation of the polytope method over Fp and a record-high binary bivariate factorisation

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data distribution in memory or on disks is an important factor influencing the performance of parallel applications. On the other hand, programs or systems, like a parallel file system, frequently redistribute data between memory and disks.This paper ...