JCT
2008
13 years 4 months ago
2008
We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Stefankovic (2001), which provides bounds on degrees of polynomials with p-adically controlled beh...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
JAT
2008
13 years 4 months ago
2008
It is well known that if a finite order linear differential operator with polynomial coefficients has as eigenfunctions a sequence of orthogonal polynomials with respect to a posi...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
COMPUTING
2006
13 years 4 months ago
2006
The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of t...
DM
2008
13 years 4 months ago
2008
Abstract. It is known that the weight enumerator of a self-dual doublyeven code in genus g = 1 can be uniquely written as an isobaric polynomial in certain homogeneous polynomials ...
ECCC
2010
13 years 4 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
ECCC
2010
13 years 4 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f : {0, 1}n {-1, 1} is an s-sparse GF(2) polynomial versus -far ...