Badge
| Scholar | Asked a question and accepted an answer. |
This badge has been awarded 799 times. Recently awarded to: |
17h ago
Sublinear query time for the $i$th element of an array after some additions?
— mohammed essam
1134
1d ago
Lower-bound complexities for finding common elements between two unsorted arrays
— Bakuriu
1135
may 16 at 17:08
Realtime hardware/software versus PC software/hardware, how are these distinct and alike? [closed]
— BumSkeeter
1163
may 16 at 8:10
Is “Find the shortest tour from a to z passing each node once in a directed graph” NP-complete?
— urzeit
233
may 16 at 7:10
Understanding LEADING and TRAILING operations of an operator precedence grammar
— Likhit
132
may 15 at 17:40
Reducing from Hamiltonian Cycle problem to the Graph Wheel problem cannot be proved vice versa [closed]
— Ronnie
11
may 15 at 17:30
Example of a non-context free language that nonetheless CAN be pumped?
— user2329564
233
may 15 at 17:30
Shortest sub-sequence of one string, that's not a sub-sequence of another string
— Mike
405
may 7 at 15:47
Is there a binary search tree datastructure which can avoid becoming badly weight-balanced?
— Niel de Beaudrap
2,373318
may 6 at 19:26
Clique in P when the input graph's connected components have at most $3\log|V|$ vertices?
— Dominik_svk
154
may 5 at 16: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 13:22
NP complete problems that are solvable in polynomial time if the input (e.g. number of variables) is fixed?
— user2145167
1485
may 5 at 13:07
Optimal upper bound on the number of states in the complement of an NFA
— Bryan Olivier
1685
may 1 at 19:01
What type of formal notation is being used here to represent functional algorithms?
— David Kaczynski
1136
apr 29 at 10:24
Finding a tree that approximates the distances and total weights
— Fayez Abdlrazaq Deab
1327
apr 28 at 7:04
Can all permutations of a set or string be generated in O(n log n) time?
— Sam Vernalis
62
apr 27 at 10:48
Prove that $L_1$ is regular if $L_2$, $L_1L_2$, $L_2L_1$ are regular
— Alejandro Sazo
34517
apr 26 at 0:59
Prove NP-completeness of deciding satisfiability of monotone boolean formula
— nat
182