Sciweavers

1380 search results - page 38 / 276
» A General Polynomial Sieve
Sort
View
TCS
2008
13 years 8 months ago
Curves and surfaces represented by polynomial support functions
This paper studies shapes (curves and surfaces) which can be described by (piecewise) polynomial support functions. The class of these shapes is closed under convolutions, offsett...
Zbynek Sír, Jens Gravesen, Bert Jüttle...
TIM
2010
144views Education» more  TIM 2010»
13 years 3 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
FOCS
2004
IEEE
14 years 12 days ago
Testing Low-Degree Polynomials over Prime Fields
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...
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra...
CC
2010
Springer
112views System Software» more  CC 2010»
13 years 3 months ago
Random Cnf's are Hard for the Polynomial Calculus
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...
Eli Ben-Sasson, Russell Impagliazzo
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 9 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer