Sciweavers

8 search results - page 1 / 2

» stoc 1989

12

STOC
1989
ACM

95views Algorithms» more STOC 1989»

A Hard-Core Predicate for all One-Way Functions

13 years 9 months ago

A Hard-Core Predicate for all One-Way Functions

Download www.wisdom.weizmann.ac.il

Oded Goldreich, Leonid A. Levin

claim paper

Read More »

13

STOC
1989
ACM

66views Algorithms» more STOC 1989»

The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial

13 years 9 months ago

The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial

Download users.soe.ucsc.edu

Leonard Pitt, Manfred K. Warmuth

claim paper

Read More »

13

STOC
1989
ACM

72views Algorithms» more STOC 1989»

Trading Space for Time in Undirected s-t Connectivity

13 years 9 months ago

Trading Space for Time in Undirected s-t Connectivity

Download www.hpl.hp.com

Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghav...

claim paper

Read More »

11

STOC
1989
ACM

99views Algorithms» more STOC 1989»

A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies

13 years 9 months ago

A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies

Download www.math.cmu.edu

We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...

Martin E. Dyer, Alan M. Frieze, Ravi Kannan

claim paper

Read More »

13

STOC
2002
ACM

115views Algorithms» more STOC 2002»

Reimer's inequality and tardos' conjecture

14 years 5 months ago

Reimer's inequality and tardos' conjecture

Download www-math.mit.edu

Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...

Clifford D. Smyth

claim paper

Read More »

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