Abstract: It is shown that the monotone analog of logspace computation is more powerful than monotone log-depth circuits: monotone circuits for a certain ...
Monotone Separation of Logspace from NC¹. Michelangelo Grigni*. Michael Sipser*. Department of Mathematics. Massachusetts Institute of Technology. Cambridge, MA ...
It is shown that the monotone analog of logspace computation is more powerful than monotone log-depth circuits.
Bibliographic details on Monotone Separation of Logspace from NC.
In particular, we get a new proof for Karchmer-Wigderson's Q(log* n) lower bound for st-connectivity, on a graph with n vertices, and a new (tight) lower bound ...
We achieve the separation of the following classes. 1. monotone-NC ≠ monotone-P. 2. For every i≥1, monotone-≠ monotone-. 3. More generally: For any integer ...
We prove tight lower bounds, of up to n∈, for the monotone depth of functions in monotone-P. As a result we achieve the separation of the following classes.
As a result we achieve the separation of the following classes. 1. Monotone-NC/spl ne/monotone-P. 2. /spl forall/i/spl ges/1, monotone-NC/sup i//spl ne/monotone ...
As a result we achieve the separation of the following classes. 1. monotone-NC not equal monotone-P. 2. For All i greater than or equal to 1, monotone-NCi not ...
We show that the monotone analogue of logspace computation is more powerful than monotone log-depth circuits: monotone bounded fanin circuits for a certain ...
Missing: NC. | Show results with:NC.