STOC
1996
ACM
14 years 5 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
STOC
1996
ACM
14 years 5 months ago
1996
ACM
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
STOC
1996
ACM
14 years 5 months ago
1996
ACM
If disks are moved so that each center
STOC
1996
ACM
14 years 5 months ago
1996
ACM
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
STOC
1996
ACM
14 years 5 months ago
1996
ACM
STOC
1996
ACM
14 years 5 months ago
1996
ACM
STOC
1996
ACM
14 years 5 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
STOC
1996
ACM
14 years 5 months ago
1996
ACM
