Computer Science

Enlightened

 Enlightened
First to answer and accepted with score of 10 or more. This badge can be awarded multiple times.

earned this badge 17 times.
Is there a name for the class of algorithms that are the most efficient for a particular task?
Awarded Feb 17 '20 at 13:30
How to develop an $O(N)$ algorithm solve the 2-sum problem?
Awarded Mar 20 '18 at 17:47
If all edges are of equal weight, can one use BFS to obtain a minimal spanning tree?
Awarded Dec 28 '17 at 6:42
Finding the minimum cut of an undirected graph
Awarded Feb 13 '17 at 18:31
Why does heapsort run in $\Theta(n \log n)$ instead of $\Theta(n^2 \log n)$ time?
Awarded Oct 4 '16 at 22:43
Does a graph always have a minimum spanning tree that is binary?
Awarded Jan 25 '15 at 19:37
Are all known algorithms for solving NP-complete problems constructive?
Awarded Oct 12 '14 at 0:26
How can I verify a solution to Travelling Salesman Problem in polynomial time?
Awarded Mar 13 '14 at 11:58
Classification of intractable/tractable satisfiability problem variants
Awarded Feb 28 '14 at 6:31
$O(n^{k-1}$) algorithm for K-clique problem
Awarded Jan 20 '14 at 17:14
Complexity of deciding if a formula has exactly 1 satisfying assignment
Awarded Oct 28 '13 at 21:54
What randomness really is
Awarded Jun 3 '13 at 7:21
How to measure “sortedness”
Awarded May 7 '13 at 8:20
Is there a sometimes-efficient algorithm to solve #SAT?
Awarded Feb 12 '13 at 20:05
Generating inputs for random-testing graph algorithms?
Awarded Oct 8 '12 at 20:43
Difference between “information” and “useful information” in algorithmic information theory
Awarded Sep 11 '12 at 0:03
Measuring the difficulty of SAT instances
Awarded Jul 13 '12 at 20:48

Others with this badge