Sciweavers

9 search results - page 1 / 2
» stoc 1992
Sort
View
STOC
1992
ACM
104views Algorithms» more  STOC 1992»
15 years 10 months ago
Biconnectivity Approximations and Graph Carvings
Samir Khuller, Uzi Vishkin
STOC
1992
ACM
127views Algorithms» more  STOC 1992»
15 years 10 months ago
Entropy and Sorting
Jeff Kahn, Jeong Han Kim
STOC
1992
ACM
89views Algorithms» more  STOC 1992»
15 years 10 months ago
Exponential Lower Bounds for the Pigeonhole Principle
Paul Beame, Russell Impagliazzo, Jan Krajíc...
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 10 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
15 years 10 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...