Computational Complexity(19)

In this work we study complexity classes in monotone computation. Our main contributions are the following: ffl A consistent framework for monotone computation, including monotone analogues of many standard computational models. We define monotone simulati

C8ahpte r2oMotonenCo mpexliyIt nthis chpteraw ede n ea ollectionco fmootonnec ompexltiymod les nalaooug ts moor geneeralmach ne iomdles; from htse medels weode ne he monttooen compleitx yclassesalread y niormfallyi tnrduoed ic tnhe ast lhacterp.Thi sprvoidse a ich crlasi sactoni sstem yof mrnootne ofuntcios nicnudinlgmo stmono tne circoit ulascssepr evousily ocnidsrede,as w el lsa onmotoe npace-sboudne docmpexlity lcsaess wihhch ve raeceveid iltte altentton.iA geernla feautre tahte megesra mon tgehe sodems lis thta when ome fsom rofno netedriminmsis av iaablle i,t s ismipe tlo

dene r bostuunif rmom ootnoe modelns .n tIe dhteerimnstiicmode lsi stenda wem ustg veiu unpifomitr, oy rf weit ryt foore cunfiromit ytehnth eomde ls ino rtbout (sie.. sligh vtaratioisn ni tehd e ntioi nofu inforitmyor ht eomel day imn acf thcagenthe poew rof the omde). lW ehso thaw tmny astandra dsiulatimnosm y abeca rire oudti na m nootneo afhsoniso that t hef amliira lascsc onaitmnetsn stli lhold .eW cnosdier th netioo of monontne rodeciubiliy andtc molepe ptrolbmesfor htsee lcasse. Wse olflwo tehu salucon entvio ofni edtinfyng iala nugae g L0f 1g; ithwa se qunce efo Boleoanf nuctons fifn: f0 1;ng f0!;1g ng 0,whe refn ( x)=1i 2 L x\f;0 g1n . lAos w ewil lsuulay sulprpessth eusbscirptn

.19