User joker

13 votes

4 answers

45k views

Complexity of recursive Fibonacci algorithm

asked Oct 1, 2013 at 13:21

3 votes

1 answer

9k views

Drawing an implication graph for 2-SAT clauses

asked Oct 21, 2013 at 18:35

2 votes

1 answer

2k views

Converting a 2-SAT formula into an implication graph

asked Oct 17, 2013 at 14:06

2 votes

4 answers

4k views

Resolution and what it means to derive the empty set

asked Nov 16, 2013 at 21:19

2 votes

3 answers

452 views

Can not follow the example for max-flow-min-cut on Wikipedia

asked May 3, 2014 at 8:15

1 vote

1 answer

2k views

RSA encryption why does ed=1?

asked May 23, 2014 at 11:07

1 vote

1 answer

101 views

Satisfiabilty 2-sat

asked May 3, 2014 at 6:14

1 vote

2 answers

1k views

Why have additional symbols on a Turing machine?

asked Jan 23, 2014 at 16:19

1 vote

2 answers

1k views

Applying dynamic programming to a simple two-person game of perfect information

asked Nov 16, 2013 at 21:17

0 votes

1 answer

95 views

Cryptography substitution frequency analysis

asked Dec 15, 2013 at 9:38

0 votes

2 answers

169 views

Decrypting transposition ciphers

asked Jan 2, 2014 at 15:19

0 votes

3 answers

297 views

Do sparse graphs have to be large?

asked Apr 8, 2014 at 11:40

0 votes

1 answer

282 views

Amdahl law and parallelism

asked Apr 29, 2014 at 13:34

0 votes

1 answer

463 views

How can a problem be undecidable yet enumerable? [duplicate]

asked May 8, 2014 at 21:47

-1 votes

1 answer

153 views

TCP repeated acknowledgement

asked May 24, 2014 at 10:56

-1 votes

3 answers

1k views

Dijkstra algorithm: equal number of shortest paths

asked Mar 6, 2013 at 20:01

-1 votes

1 answer

76 views

Minimizing the following objective function with matrices [closed]

asked Mar 13, 2014 at 9:35

Stack Exchange Network

17 Questions

Complexity of recursive Fibonacci algorithm

Drawing an implication graph for 2-SAT clauses

Converting a 2-SAT formula into an implication graph

Resolution and what it means to derive the empty set

Can not follow the example for max-flow-min-cut on Wikipedia

RSA encryption why does ed=1?

Satisfiabilty 2-sat

Why have additional symbols on a Turing machine?

Applying dynamic programming to a simple two-person game of perfect information

Cryptography substitution frequency analysis

Decrypting transposition ciphers

Do sparse graphs have to be large?

Amdahl law and parallelism

How can a problem be undecidable yet enumerable? [duplicate]

TCP repeated acknowledgement

Dijkstra algorithm: equal number of shortest paths

Minimizing the following objective function with matrices [closed]