Search Sciweavers | Sciweavers

6 search results - page 1 / 2

» jacm 1998

click to vote

JACM
1998

52views more JACM 1998»

Randomized Binary Search Trees

13 years 4 months ago

Download compgeom.cs.uiuc.edu

Conrado Martínez, Salvador Roura

claim paper

Read More »

click to vote

JACM
1998

51views more JACM 1998»

Explicit OR-Dispersers with Polylogarithmic Degree

13 years 4 months ago

Download www.cis.upenn.edu

Michael E. Saks, Aravind Srinivasan, Shiyu Zhou

claim paper

Read More »

click to vote

JACM
1998

82views more JACM 1998»

Relational Expressive Power of Constraint Query Languages

13 years 4 months ago

Download reference.kfupm.edu.sa

Michael Benedikt, Guozhu Dong, Leonid Libkin, Lims...

claim paper

Read More »

click to vote

JACM
1998

88views more JACM 1998»

A Threshold of ln n for Approximating Set Cover

13 years 4 months ago

Download www.cs.duke.edu

Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...

Uriel Feige

claim paper

Read More »

click to vote

ECCC
2000

101views more ECCC 2000»

Simplified derandomization of BPP using a hitting set generator

13 years 5 months ago

Download www.wisdom.weizmann.ac.il

Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...

Oded Goldreich, Salil P. Vadhan, Avi Wigderson

claim paper

Read More »

« Prev « First page 1 / 2 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers