Grigni, Michelangelo; Sipser, Michael Monotone complexity. (English) Zbl 0766.68040 Boolean function complexity, Sel. Pap. Symp., Durham/UK 1990, Lond. Math. Lect. Note Ser. 169, 57-75 (1992). MSC: 68Q15 68Q05 68Q10 PDF BibTeX XML Cite \textit{M. Grigni} and \textit{M. Sipser}, in: Boolean function complexity. Selected papers from the symposium sponsored by the London Mathematical Society, Durham, UK, July 1990. Cambridge: Cambridge University Press. 57--75 (1992; Zbl 0766.68040)
Borodin, Allan; Cook, Stephen A.; Dymond, Patrick W.; Ruzzos, Walter L.; Tompa, Martin Two applications of inductive counting for complementation problems. (English) Zbl 0678.68031 SIAM J. Comput. 18, No. 3, 559-578 (1989). MSC: 68Q25 68Q45 68R10 60G50 94C99 03D55 91A05 PDF BibTeX XML Cite \textit{A. Borodin} et al., SIAM J. Comput. 18, No. 3, 559--578 (1989; Zbl 0678.68031) Full Text: DOI
Immerman, Neil Nondeterministic space is closed under complementation. (English) Zbl 0668.68056 SIAM J. Comput. 17, No. 5, 935-938 (1988). MSC: 68Q05 68Q25 03D15 PDF BibTeX XML Cite \textit{N. Immerman}, SIAM J. Comput. 17, No. 5, 935--938 (1988; Zbl 0668.68056) Full Text: DOI Link