Title :
Monotone separation of logspace from NC1
Author :
Grigni, Michelangelo ; Sipser, Michael
Author_Institution :
Dept. of Math., MIT, Cambridge, MA, USA
fDate :
30 Jun-3 Jul 1991
Abstract :
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 mNC1≠mL . 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)
Keywords :
computational complexity; communication game; logspace computation; monotone NC1 circuit; monotone analog; monotone log-depth circuits; monotone logspace; monotone separation; pointer chain; pointer jumping; Boolean functions; Circuits; Complexity theory; Contracts; MONOS devices; Mathematics; Polynomials; Robustness; Turing machines;
Conference_Titel :
Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual
Conference_Location :
Chicago, IL
Print_ISBN :
0-8186-2255-5
DOI :
10.1109/SCT.1991.160272
