skip to main content
review-article

P, NP, and NP-Completeness: the basics of computational complexity by Oded Goldreich

Published: 24 January 2011 Publication History

Abstract

No abstract available.

Index Terms

  1. P, NP, and NP-Completeness: the basics of computational complexity by Oded Goldreich

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM SIGSOFT Software Engineering Notes
      ACM SIGSOFT Software Engineering Notes  Volume 36, Issue 1
      January 2011
      210 pages
      ISSN:0163-5948
      DOI:10.1145/1921532
      Issue’s Table of Contents

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 24 January 2011
      Published in SIGSOFT Volume 36, Issue 1

      Check for updates

      Qualifiers

      • Review-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 300
        Total Downloads
      • Downloads (Last 12 months)8
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 12 Feb 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media