Monotone Complexity

Monotone Complexity (1990)

by Michelangelo Grigni , Michael Sipser

Citations:

User correction supplied by mph

Datum	Value	Source
TITLE	Monotone Complexity	user correction - Legacy Corrections
AUTHOR NAME	Michelangelo Grigni	user correction
AUTHOR NAME	Michael Sipser	user correction
AUTHOR AFFIL		user correction
AUTHOR ADDR		user correction
ABSTRACT	We give a general complexity classification scheme for monotone computation, including monotone space-bounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple notion of monotone reducibility and exhibit complete problems. This provides a framework for stating existing results and asking new questions. We show that mNL (monotone nondeterministic log-space) is not closed under complementation, in contrast to Immerman's and Szelepcs 'enyi's nonmonotone result [Imm88, Sze87] that NL = co-NL; this is a simple extension of the monotone circuit depth lower bound of Karchmer and Wigderson [KW90] for st-connectivity. We also consider mBWBP (monotone bounded width branching programs) and study the question of whether mBWBP is properly contained in mNC 1 , motivated by Barrington's result [Bar89] that BWBP = NC 1 . Although we cannot answer t...	user correction - Legacy Corrections
YEAR	1990	user correction - Legacy Corrections
CITATIONS	26 found	ParsCit 1.0