Sciweavers

FFA
2008
75views more  FFA 2008»
13 years 4 months 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»
14 years 4 months 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