Jeffε's user avatar
Jeffε's user avatar
Jeffε's user avatar
Jeffε
  • Member for 13 years, 8 months
  • Last seen more than 1 year ago
11 votes

Rigour leading to insight

5 votes

Is it NP-hard to play international draughts correctly?

27 votes

Examples of "Unrelated" Mathematics Playing a Fundamental Role in TCS?

41 votes

What is the oldest open problem in TCS?

61 votes

How do I referee a paper?

6 votes

Intractability of NP-complete problems as a principle of physics?

64 votes
Accepted

Why is CNF used for SAT and not DNF?

12 votes

Truly random number generator: Turing computable?

10 votes

Problems that can be used to show polynomial-time hardness results

23 votes

Problems Between P and NPC

3 votes

Linear Time Maximum Clearance Computation on a Grid Graph?

8 votes

Reductions from the book.

71 votes

Major unsolved problems in theoretical computer science?

15 votes
Accepted

Lower bounds for linear satisfiability problem

5 votes

Everyday encounters with NP-complete problems

116 votes

Algorithms from the Book

67 votes

Major unsolved problems in theoretical computer science?

10 votes

Where and how did computers help prove a theorem?

4 votes

A more intuitive proof of the Zone theorem ?

49 votes

Major unsolved problems in theoretical computer science?

19 votes

Complexity of the Fisher-Yates Shuffle Algorithm

1 2 3 4
5