148
click to vote
STOC
15 years 4 months ago
1994 ACM 
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
114
Voted
STOC
15 years 4 months ago
1994 ACM 
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
109
click to vote
STOC
15 years 4 months ago
1994 ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
101
click to vote
STOC
15 years 4 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...
101
click to vote
STOC
15 years 4 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...
|
Algorithms