76 search results - page 6 / 16 » Testing Polynomials over General Fields |
STOC
2010
ACM
14 years 4 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
CC
2010
Springer
13 years 1 months ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
HPCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
OSDI
2008
ACM
14 years 7 months ago
2008
ACM
Hard disk drives returned back to Seagate undergo the Field Return Incoming Test. During the test, the available logs in disk drives are collected, if possible. These logs contain...
SETA
2004
Springer
14 years 24 days ago
2004
Springer
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations o...