Search Results
| 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 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| 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 conditional-results
Search options questions only
not deleted
user 947
Add X as a hypothesis, where X is not known to be either true or false.
12
votes
1
answer
1k
views
Consensus on P = NP in a world where RP = NP
$RP = NP$ is widely conjectured to be false.
But imagine for a moment that it is true. In such case, how likely would be that $P = NP$?
Put in other words: in a world where $RP = NP$, what might sti …
- 6,912
38
votes
3
answers
5k
views
Consequences of Factoring being in P?
Factoring is not known to be NP-complete. This question asked for consequences of Factoring being NP-complete. Curiously, no one asked for consequences of Factoring being in P (maybe because such a qu …
- 6,912
36
votes
2
answers
2k
views
Consequences of $SAT \in BQP$
As a TCS amateur, I'm reading some popular, very introductory material on quantum computing. Here are the few elementary bits of information I've learned so far:
Quantum computers are not known to s …
- 6,912