Theoretical Computer Science

42

FOCS
2000
IEEE

92views Theoretical Computer Science» more FOCS 2000»

14 years 4 months ago

We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...

Ravi Kannan, Santosh Vempala, Adrian Vetta

claim paper

Read More »

40

click to vote

FOCS
2000
IEEE

173views Theoretical Computer Science» more FOCS 2000»

Extracting Randomness from Samplable Distributions

14 years 4 months ago

Download people.seas.harvard.edu

Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...

Luca Trevisan, Salil P. Vadhan

claim paper

Read More »

36

click to vote

FOCS
2000
IEEE

108views Theoretical Computer Science» more FOCS 2000»

On the Hardness of Graph Isomorphism

14 years 4 months ago

Download theorie.informatik.uni-ulm.de

We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...

Jacobo Torán

claim paper

Read More »

32

click to vote

FOCS
2000
IEEE

104views Theoretical Computer Science» more FOCS 2000»

Extracting Randomness via Repeated Condensing

14 years 4 months ago

Download www.math.ias.edu

Extractors (deﬁned by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...

Omer Reingold, Ronen Shaltiel, Avi Wigderson

claim paper

Read More »

31

click to vote

FOCS
2000
IEEE

86views Theoretical Computer Science» more FOCS 2000»

Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors

14 years 4 months ago