Juho's user avatar
Juho's user avatar
Juho's user avatar
Juho
  • Member for 12 years, 1 month
  • Last seen this week
75 votes

How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect

35 votes
Accepted

How to measure "sortedness"

34 votes
Accepted

Is there a name for the class of algorithms that are the most efficient for a particular task?

28 votes

What are GPUs bad at?

26 votes
Accepted

Measuring the difficulty of SAT instances

25 votes

What are some real world applications of graphs?

22 votes
Accepted

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

22 votes
Accepted

Is there a sometimes-efficient algorithm to solve #SAT?

21 votes
Accepted

$O(n^{k-1}$) algorithm for K-clique problem

19 votes
Accepted

When to use recursion?

18 votes
Accepted

Classification of intractable/tractable satisfiability problem variants

18 votes

The time complexity of finding the diameter of a graph

18 votes
Accepted

What randomness really is

18 votes
Accepted

Does a graph always have a minimum spanning tree that is binary?

18 votes

What would be the real-world implications of a constructive $P=NP$ proof?

17 votes

What does the 2 in a 2-approximation algorithm mean?

16 votes

What is an asymptotically tight upper bound?

16 votes

What are common techniques for reducing problems to each other?

16 votes
Accepted

Generating inputs for random-testing graph algorithms?

15 votes
Accepted

If all edges are of equal weight, can one use BFS to obtain a minimal spanning tree?

15 votes

Is Group Theory useful in Computer Science in areas other than cryptography?

14 votes
Accepted

Finding the minimum cut of an undirected graph

13 votes
Accepted

How to develop an $O(N)$ algorithm solve the 2-sum problem?

13 votes

Efficient map data structure supporting approximate lookup

13 votes

Are there variations of the regular runtimes of the Big-O-Notation?

13 votes

Do you ever "download" a language?

12 votes
Accepted

Difference between "information" and "useful information" in algorithmic information theory

12 votes
Accepted

Why does heapsort run in $\Theta(n \log n)$ instead of $\Theta(n^2 \log n)$ time?

12 votes
Accepted

Are all known algorithms for solving NP-complete problems constructive?

11 votes
Accepted

Complexity of deciding if a formula has exactly 1 satisfying assignment

1
2 3 4 5
14