Next: Session-Key Generation using Human
Up: Back at Weizmann (1998-2003)
Previous: On Pseudorandomness with respect
This work shows that a natural sub-linear time algorithm is a
tester of graph expansion, provided that a plausible
combinatorial conjecture holds.
Comments:
Authored by O. Goldreich and D. Ron. Appeared in
ECCC, TR00-020, 2000.
Oded Goldreich
2003-07-30