Sciweavers

14 search results - page 1 / 3
» stoc 1990
Sort
View
STOC
1990
ACM
81views Algorithms» more  STOC 1990»
13 years 9 months ago
Approximate Inclusion-Exclusion
Nathan Linial, Noam Nisan
STOC
1990
ACM
78views Algorithms» more  STOC 1990»
13 years 9 months ago
Computing in Quotient Groups
William M. Kantor, Eugene M. Luks
STOC
1990
ACM
96views Algorithms» more  STOC 1990»
13 years 9 months ago
Monotone Circuits for Matching Require Linear Depth
We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and non...
Ran Raz, Avi Wigderson
STOC
1990
ACM
99views Algorithms» more  STOC 1990»
13 years 9 months ago
The Number Field Sieve
The number field sieve is an algorithm to factor integers of the form re
Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. ...