Monotone Separation of Logarithmic Space from Logarithmic Depth

We show that the monotone analogue of logspace computation is more powerful than monotone log-depth circuits: monotone bounded fanin circuits for a certain function in monotone logspace require depth Ω(lg2n).

Saved in:
Bibliographic Details
Published inJournal of computer and system sciences Vol. 50; no. 3; pp. 433 - 437
Main Authors Grigni, M., Sipser, M.
Format Journal Article
LanguageEnglish
Published Brugge Elsevier Inc 01.06.1995
Academic Press
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Automata. Abstract machines. Turing machines
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Monotonic function
Lower bound
Complexity class
Logarithmic function
Simulation
Turing machine
Computational complexity
Monotonicity
Depth
Online AccessGet full text

Cover

More Information
Summary:We show that the monotone analogue of logspace computation is more powerful than monotone log-depth circuits: monotone bounded fanin circuits for a certain function in monotone logspace require depth Ω(lg2n).
ISSN:0022-0000
1090-2724
DOI:10.1006/jcss.1995.1033