534 search results - page 8 / 107 » Efficient polynomial L-approximations |
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type ZZ T {f0} 12 dx dy for quadratic p...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduc...
FCSC
2008
13 years 7 months ago
2008
Abstract. We discuss the verification of mathematical software solving polynomial systems symbolically by way of triangular decomposition. Standard verification techniques are high...