Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 836

Questions about decision problems that can be solved on nondeterministic Turing machines in time polynomial in the length of the input.

1
vote
This is merely an elaboration of the first sentence of @chi's answer, since I did not find it obvious. The idea is, if you have an algorithm that finds the answer to some problem in polynomial time, …
answered Dec 8 '16 by Mehrdad
1
vote
1answer
polynomial time. But is there a proof of whether or not it can be verified in polynomial time assuming P ≠ NP? …
asked Feb 2 '14 by Mehrdad