Badge
| Student | Asked first question with score of 1 or more. |
This badge has been awarded 1301 times. Recently awarded to: |
1d ago
Is there an affordable experiment which shows chips can't get much smaller?
— TheInfamousBT
211
1d ago
Realtime hardware/software versus PC software/hardware, how are these distinct and alike?
— BumSkeeter
1183
2d ago
Is “Find the shortest tour from a to z passing each node once in a directed graph” NP-complete?
— urzeit
233
may 15 at 3:11
In the Hopcroft-Karp algorithm, what is the purpose of the breadth first search?
— Duncan
61
may 14 at 19:53
Understanding why the polynomial $p(n) = \sum_{i=0}^{k} a_in^i$ is in $\Theta(n^k)$
— Alfreda Zuñiga
211
may 14 at 11:11
Pushdown automation where number of letter `a` is at least as twice as letter `b` in the word
— user2380858
161
may 10 at 0:31
Show that it is undecidable if two Turing Machines accept the same language
— user1888502
161
may 8 at 23:29
Time complexity in Big O notation for Harmonic series with first k terms missing
— wookie919
362
may 7 at 11:10
How to distinguish whether a sample is from distribution $\chi_1$ or $\chi_2$?
— Richard
162
may 7 at 6:49
Interval Scheduling Optimization type of Problem, optimal order of manufacture
— user8075
41
may 7 at 0:12
Why don't we scale the cost of memory access when analyzing runtime of algorithms?
— Andrew
61
may 5 at 15:38
Prove that inserting $n$ sorted values in to an AVL using AVL insertion is $\Theta\left (n \log \left ( n \right ) \right )$
— Scis
274
may 5 at 14:07
Complexity of finding a subset of vertices within distance k of each other, given a set of vertices
— owls owls owls
111
may 5 at 12:27
Optimal upper bound on the number of states in the complement of an NFA
— Bryan Olivier
1685
may 4 at 20:38
How is sound input and output data converted to use with machine learning networks?
— naxa
1063
may 4 at 18:12
Sublinear query time for the $i$th element of an array after some additions?
— mohammed essam
1113
may 4 at 12:40
Is there a binary tree structure with fast access to recently accessed elements and worst $O \left( \log n \right )$ complexity?
— Petr Pudlák
89719
may 3 at 13:41
Is there a binary search tree datastructure which can avoid becoming badly weight-balanced?
— Niel de Beaudrap
2,373318