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 complexity-theory
Search options not deleted
user 7173
Questions related to the (computational) complexity of solving problems
2
votes
1
answer
2k
views
Converting a 2-SAT formula into an implication graph
Both wikipedia and my lecturer explained how the 2 satisfiability problem work. However, I am finding it really hard understanding how this formula:
xvy≡ ¬x-->y ≡ ¬y -->x
Then breaks down the follo …
- 469
1
vote
2
answers
1k
views
Applying dynamic programming to a simple two-person game of perfect information
A natural number n represents the initial position in the game. When it is a players turn he/she is allowed to
I) Subtract 2 from n
II) Subtract 3 from n
III) Subtract 5 from n
We call the pla …
- 469
1
vote
1
answer
2k
views
RSA encryption why does ed=1?
So I fully understand the how the RSA algorithm works, but now I am trying to reason with the formula. I want to know:
why the public key e and the private key d in the RSA encryption have
to s …
- 469
3
votes
1
answer
9k
views
Drawing an implication graph for 2-SAT clauses
I am trying to convert the following 2-sat clauses to implications and then draw the implication graph.
The clauses are: {¬xvy}, {¬yvz}, {¬zvw} ,{¬wvu},{¬uv¬x},{xvw},{¬wvx}
I converted the boolean l …
- 469