skip to main content
article
Free Access

The monotone and planar circuit value problems are log space complete for P

Published:01 July 1977Publication History
First page image

References

  1. "Cook, S. A., "An Observation on Time-Storage Trade Off" JCSS, vol. 9, No. 3, Dec. 1974 (308--316).Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. Ladner, R. E., "The Circuit Value Problem is Log Space Complete for P", SIGACT News, vol. 7, No. 1, Jan. 1975 (18--20). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Stockmeyer, L. J., "Planar 3-Colorability is Polynomial Complete", SIGACT News, vol.5, No. 3, July 1973 (19--25). Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGACT News
    ACM SIGACT News  Volume 9, Issue 2
    Summer 1977
    28 pages
    ISSN:0163-5700
    DOI:10.1145/1008354
    Issue’s Table of Contents

    Copyright © 1977 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 July 1977

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader