Journal of the ACM Bibliography
Miklos Ajtai and Yuri Gurevich. Monotone versus
positive. Journal of the ACM, 34(4):1004-1015, October
1987.
[BibTeX entry]
Selected papers that cite this one
- Michelangelo Grigni and Michael Sipser. Monotone separation of
logarithmic space from logarithmic depth. Journal of Computer
and System Sciences, 50(3):433-437, June 1995.
- Phokion G. Kolaitis and Madhukar N. Thakur. Approximation
properties of NP minimization classes. Journal of Computer and
System Sciences, 50(3):391-411, June 1995.
- Phokion Kolaitis and Jouko A. Väänänen. Generalized
quantifiers and pebble games on finite structures. Annals of
Pure and Applied Logic, 74(1):23-75, 27 June 1995.
- C. Lautemann, T. Schwentick, and I. A. Stewart. Positive versions of polynomial
time. Accepted for publication in Information and
Computation. Final manuscript received for publication May 17,
1998.
- Ran Raz and Avi Wigderson. Monotone circuits for matching require
linear depth. Journal of the ACM, 39(3):736-744, July
1992.
- Iain A. Stewart. Logical description
of monotone NP problems. Journal of Logic and
Computation, 4(4):337-357, August 1994.
- Alexei P. Stolboushkin. Finitely monotone
properties. In Proceedings, Tenth Annual IEEE Symposium on
Logic in Computer Science, pages 324-330, San Diego, California,
26-29 June 1995. IEEE Computer Society Press.
Shortcuts: