STOC
1994
ACM
14 years 2 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
STOC
1994
ACM
14 years 2 months ago
1994
ACM
STOC
1994
ACM
14 years 2 months ago
1994
ACM
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
STOC
1994
ACM
14 years 2 months ago
1994
ACM
STOC
1994
ACM
14 years 2 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
STOC
1994
ACM
14 years 2 months ago
1994
ACM
STOC
1994
ACM
14 years 2 months ago
1994
ACM
STOC
1994
ACM
14 years 2 months ago
1994
ACM
STOC
1994
ACM
14 years 2 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
STOC
1993
ACM
14 years 2 months ago
1993
ACM
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...