Logarithmic Space Verifiers on NP-complete

Preprint, Other literature type OPEN
Vega, Frank;
(2019)

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? A precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leo... View more
Share - Bookmark

  • Download from
    ZENODO via ZENODO (Preprint, 2019)
  • Cite this publication