Proceedings of Computational Complexity (Formerly Structure in Complexity Theory) (1996)
May 24, 1996 to May 27, 1996
Clemens Lautemann , Johannes Gutenberg-Universitat
Thomas Schwentick , Johannes Gutenberg-Universitat
Iain A. Stewart , University College of Swansea
Continuing a line of research opened up by Grigni and Sipser and further pursued by Stewart, we show that a wide variety of equivalent characterizations of P still remain equivalent when restricted to be positive. All these restrictions thus define the same class posP, a proper subclass of monP, the class of monotone problems in P. We also exhibit complete problems for posP under very weak reductions.
monotone problems, polynomial time
C. Lautemann, T. Schwentick and I. A. Stewart, "On Positive P," Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)(CCC), Philadelphia, PA, 1996, pp. 162.