171
click to vote
FOCS
15 years 7 months ago
1991 IEEE 
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
149
click to vote
FOCS
15 years 7 months ago
1991 IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
146
click to vote
FOCS
15 years 7 months ago
1991 IEEE 
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
137
click to vote
FOCS
15 years 7 months ago
1991 IEEE
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
|
Theoretical Computer Science