I-binomial scrambling of digital nets and sequences
- Shu Tezuka
- Henri Faure
- 2003
- Journal of Complexity
Publications
Date
Featured collections
Popular topics
18 results at Journal of Complexity
Lower bounds on the depth of monotone arithmetic computations
- Don Coppersmith
- Baruch Schieber
- 1999
- Journal of Complexity
Optimal Integration of Lipschitz Functions with a Gaussian Weight
- Francisco Curbera
- 1998
- Journal of Complexity
Rectangular matrix multiplication revisited
- Don Coppersmith
- 1997
- Journal of Complexity
Stably ergodic dynamical systems and partial hyperbolicity
- Charles Pugh
- Michael Shub
- 1997
- Journal of Complexity
Decoding of Reed Solomon codes beyond the error-correction bound
- Madhu Sudan
- 1997
- Journal of Complexity
A linear programming instance with many crossover events
- Shinji Mizuno
- Nimrod Megiddo
- et al.
- 1996
- Journal of Complexity
Complexity of Bezout’s Theorem. III. Condition Number and Packing
- Michael Shub
- Steve Smale
- 1993
- Journal of Complexity
Test complexity of generic polynomials
- Peter Bürgisser
- Thomas Lickteig
- et al.
- 1992
- Journal of Complexity
On the distance to the zero-set of a polynomial
- Matthew A Grayson
- 1991
- Journal of Complexity