Sciweavers

ISTCS
1995
Springer
13 years 10 months ago
Some Improvements to Total Degree Tests
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
Katalin Friedl, Madhu Sudan
ISTCS
1995
Springer
13 years 10 months ago
Computation of Highly Regular Nearby Points
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
Carsten Rössner, Claus-Peter Schnorr
ISTCS
1995
Springer
13 years 10 months ago
Towards A Practical Snapshot Algorithm
Yaron Riany, Nir Shavit, Dan Touitou
ISTCS
1995
Springer
13 years 10 months ago
On the Role of Shared Randomness in Two Prover Proof Systems
Mihir Bellare, Uriel Feige, Joe Kilian