[go: nahoru, domu]

Jump to content

Information for "P versus NP problem"

Basic information

Display titleP versus NP problem
Default sort keyP Versus Np Problem
Page length (in bytes)63,895
Namespace ID0
Page ID6115
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of page watchers702
Number of page watchers who visited in the last 30 days26
Number of redirects to this page48
Counted as a content pageYes
Wikidata item IDQ746242
Local descriptionUnsolved problem in computer science
Central descriptionunsolved problem in computer science about time complexity
Page views in the past 30 days

Page protection

EditAllow all users (no expiry set)
MoveRequire administrator access (no expiry set)
View the protection log for this page.

Edit history

Page creatorAxelBoldt (talk | contribs)
Date of page creation23:04, 26 August 2001
Latest editorDiscospinster (talk | contribs)
Date of latest edit23:48, 17 May 2024
Total number of edits3,575
Recent number of edits (within past 30 days)0
Recent number of distinct authors0

Page properties

Hidden categories (10)

This page is a member of 10 hidden categories (help):

Transcluded templates (114)

Pages transcluded onto the current version of this page (help):

Wikidata entities used in this page
  • P versus NP problem
    • Sitelink
    • Title
    • Description: en
    • Statement: P935
    • Statement: P910
    • Statement: P1754
    • Statement: P373

External tools