- "Cook, S. A., "An Observation on Time-Storage Trade Off" JCSS, vol. 9, No. 3, Dec. 1974 (308--316).Google ScholarDigital Library
- Jones, N. D. and Laaser, W. T., "Complete Problems for Deterministic Polynomial Time", Proc. of 6th Annual ACM STOC, April-May 1974 (40--46). Google ScholarDigital Library
- Ladner, R. E., "The Circuit Value Problem is Log Space Complete for P", SIGACT News, vol. 7, No. 1, Jan. 1975 (18--20). Google ScholarDigital Library
- Stockmeyer, L. J., "Planar 3-Colorability is Polynomial Complete", SIGACT News, vol.5, No. 3, July 1973 (19--25). Google ScholarDigital Library
Recommendations
Pseudo-monotone complementarity problems in Hilbert space
In this paper, some existence results for a nonlinear complementarity problem involving a pseudo-monotone mapping over an arbitrary closed convex cone in a real Hilbert space are established. In particular, some known existence results for a nonlinear ...
Monotone generalized variational inequalities and generalized complementarity problems
Some existence results for generalized variational inequalities and generalized complementarity problems involving quasimonotone and pseudomonotone set-valued mappings in reflexive Banach spaces are proved. In particular, some known results for ...
An Infeasible Path-Following Method for Monotone Complementarity Problems
We propose an infeasible path-following method for solving the monotone complementarity problem. This method maintains positivity of the iterates and uses two Newton steps per iteration---one with a centering term for global convergence and one without ...
Comments