STOC
1990
ACM
13 years 9 months ago
1990
ACM
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...
STOC
1990
ACM
13 years 9 months ago
1990
ACM
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
STOC
1990
ACM
13 years 9 months ago
1990
ACM
STOC
1990
ACM
13 years 9 months ago
1990
ACM
The number field sieve is an algorithm to factor integers of the form re
STOC
1990
ACM
13 years 9 months ago
1990
ACM
STOC
1990
ACM
13 years 9 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
STOC
1990
ACM
13 years 9 months ago
1990
ACM
STOC
1990
ACM
13 years 9 months ago
1990
ACM
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
STOC
1990
ACM
13 years 9 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...