507 search results - page 4 / 102 » Computing Sparse Multiples of Polynomials |
SPAA
2009
ACM
14 years 7 months ago
2009
ACM
CORR
1998
Springer
13 years 6 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
IAJIT
2011
13 years 1 months ago
2011
: The present paper discusses the implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a PC-Cluste...
CATA
2010
13 years 8 months ago
2010
Computations with sparse matrices on "multicore cache based" computers are affected by the irregularity of the problem at hand, and performance degrades easily. In this ...
ECCC
2011
13 years 1 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...