Monotone Complexity-英文文献.pdfVIP

Grigni: [4] Monotone Complexity y Michelangelo Grigni Michael Sipser Abstract We give a general complexity classication scheme for monotone computation including monotone spaceb ounded and Turing machine mo dels not previously considered We prop ose monotone complexity classes including mA C i mNC i mLOGCFL mBWBP mL mNL mP mBPP and mNP We dene 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 logspace is not closed under complementation in contrast to Immermans and Szelep csen yis nonmonotone result Imm Sze that NL coNL this is a simple extension of the monotone circuit depth lower b ound of Karchmer and Wigderson KW for stconnectivity We also consider mBWBP monotone b ounded width branching programs and study the question of whether mBWBP is prop erly contained in mNC motivated by Barringtons result Bar that BWBP NC Although we cannot answer this question we show two preliminary results every monotone branching program for ma jor ity has size n with no width restriction and no monotone analogue of Barringtons gadget exists Intro duction A computation is monotone if it do es not use the negation op eration Mono tone circuits and formulas have b een studied as restricted mo dels of com putation with the goal of developing techniques for the general problem of proving lower b ounds Department of Computer Science University of British Columbia Vancouver British Columbia Canada VT Z Work compl