For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
81
views
3
references
 Top references
cited by
0
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
1 collections
    0
    shares
      155
      similar
       All similar

      One-Click Submission System Now Available for SO Preprints, learn more on how this works in our blog post and don't forget to check the video, too!

      scite_
      0
      0
      0
      0
      Smart Citations
      0
      0
      0
      0
      Citing PublicationsSupportingMentioningContrasting
      View Citations

      See how this article has been cited at scite.ai

      scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.

       
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Note for the P versus NP Problem (II)

      Preprint
      In review
      research-article
      Author(s):   1 ,
      Publication date (Electronic preprint):
      Journal: ScienceOpen Preprints
      Publisher: ScienceOpen
      Keywords: Complexity classes, boolean formula, graph, completeness, polynomial time
      Bookmark

            Abstract

            Content

            Author and article information

            Journal
            Title: ScienceOpen Preprints
            Publisher: ScienceOpen
            Publication date (Electronic preprint): 31 May 2024
            Affiliations
            [1 ] GROUPS PLUS TOURS INC., 9611 Fontainebleau Blvd, Miami, FL, 33172, USA;
            Author notes
            Author information
            https://orcid.org/0000-0001-8210-4126
            Article
            DOI: 10.14293/PR2199.000898.v1
            SO-VID: 19e69ead-1cf0-486b-b3cc-828da2902bbb
            License:

            This work has been published open access under Creative Commons Attribution License CC BY 4.0 , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Conditions, terms of use and publishing policy can be found at www.scienceopen.com .

            History
            Date received : 31 May 2024
            Categories

            Data availability: Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
            ScienceOpen disciplines: Theoretical computer science,Data structures & Algorithms
            Keywords: boolean formula,completeness,graph,polynomial time,Complexity classes

            References

            1. Fortnow Lance. The status of the P versus NP problem. Communications of the ACM. Vol. 52(9):78–86. 2009. Association for Computing Machinery (ACM). [Cross Ref]

            2. Parameterized Complexity Theory. 2006. Springer Berlin Heidelberg. [Cross Ref]

            3. Galil Zvi. Efficient algorithms for finding maximum matching in graphs. ACM Computing Surveys. Vol. 18(1):23–38. 1986. Association for Computing Machinery (ACM). [Cross Ref]

            Comments

            Comment on this article