Popular Question - Badge - Computer Science Stack Exchange

Popular Question

Question with 1,000 views. This badge can be awarded multiple times.

Lazer

1,0772 gold badges10 silver badges8 bronze badges

earned this badge 3 times.

Is it intuitive to see that finding a Hamiltonian path is not in P while finding Euler path is?

Awarded Jun 25, 2016 at 11:27

Is a push-down automaton with two stacks equivalent to a turing machine?

Awarded Oct 15, 2013 at 11:25

How can I verify a solution to Travelling Salesman Problem in polynomial time?

Awarded May 5, 2013 at 14:28

Others with this badge