By Topic

Monotone separation of logspace from NC1

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Grigni, M. ; Dept. of Math., MIT, Cambridge, MA, USA ; Sipser, M.

It is shown that the monotone analog of logspace computation is more powerful than monotone log-depth circuits: monotone circuits for a certain function in monotone logspace require depth Ω(lg2 n). It is proved that mNC1mL . This result shows that the process of pointer jumping, i.e. following a chain of pointers to the end, cannot be simulated by a monotone NC1 circuit. The proof is based upon the communication game method of A. Karchmer and A. Wigderson (1990)

Published in:

Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual

Date of Conference:

30 Jun-3 Jul 1991