Sciweavers

FFA
2008
75views more  FFA 2008»
14 years 15 days ago
Syntactical and automatic properties of sets of polynomials over finite fields
Syntactical properties of representations of integers in various number systems are well-known and have been extensively studied. In this paper, we transpose the notion of recogniz...
Michel Rigo
STOC
2007
ACM
133views Algorithms» more  STOC 2007»
15 years 23 days ago
Interpolation of depth-3 arithmetic circuits with two multiplication gates
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
Amir Shpilka