A message from our CEO about the future of Stack Overflow and Stack Exchange. Read now.
Computer Science

Help Center > Badges > Teacher

 Teacher
Answer a question with score of 1 or more.
Awarded 4652 times.
Given max-flow determine if edge is in a min-cut
Awarded Dec 19 '19 at 8:55
(post deleted or otherwise unavailable)
Awarded Dec 17 '19 at 17:00
Inorder tree tranversal on binary search tree doesn't give the elements in order?
Awarded Dec 17 '19 at 15:45
(post deleted or otherwise unavailable)
Awarded Dec 17 '19 at 12:00
How connected are information theory and algorithmic information theory?
Awarded Dec 17 '19 at 10:20
(post deleted or otherwise unavailable)
Awarded Dec 17 '19 at 10:05
(post deleted or otherwise unavailable)
Awarded Dec 17 '19 at 10:05
Why do we need full-fledged workstations running massive OSes with massive software?
Awarded Dec 16 '19 at 10:55
Minimum unweighted anticlique (independent set) cover / partition
Awarded Dec 16 '19 at 8:20
Why do we need full-fledged workstations running massive OSes with massive software?
Awarded Dec 16 '19 at 1:25
Solve Recurrence Relation
Awarded Dec 15 '19 at 15:05
What is f(x,y) in Digital Image Processing?
Awarded Dec 15 '19 at 13:00
Why do we need full-fledged workstations running massive OSes with massive software?
Awarded Dec 14 '19 at 23:15
If a problem is in P solved via dynamic programming, is it also in NP?
Awarded Dec 14 '19 at 23:05
Why do we need full-fledged workstations running massive OSes with massive software?
Awarded Dec 14 '19 at 16:10
Why do we need full-fledged workstations running massive OSes with massive software?
Awarded Dec 14 '19 at 14:45
What's the meaning of this service specification
Awarded Dec 13 '19 at 21:05
Algorithms for procedural generated mazes
Awarded Dec 13 '19 at 19:05
If a problem is in P solved via dynamic programming, is it also in NP?
Awarded Dec 13 '19 at 14:05
If A is polynomial time reducible to B and B is in NP, then A is in NP
Awarded Dec 13 '19 at 10:35
If a problem is in P solved via dynamic programming, is it also in NP?
Awarded Dec 13 '19 at 5:45
Cache Direct Map (Index, tag, hit/miss)
Awarded Dec 11 '19 at 14:40
Am I right about the differences between Floyd-Warshall, Dijkstra and Bellman-Ford algorithms?
Awarded Dec 11 '19 at 4:55
Joining line segments to make tree
Awarded Dec 11 '19 at 1:15
What is the average turnaround time?
Awarded Dec 9 '19 at 2:35
What is the significance of negative weight edges in a graph?
Awarded Dec 8 '19 at 4:45
How do I use message passing to find the maximum of all values in a grid?
Awarded Dec 6 '19 at 22:15
Complement of $a^n b^n c^n$
Awarded Dec 6 '19 at 19:00
Is dynamic programming restricted to optimization problems?
Awarded Dec 6 '19 at 7:55
Difference between a skiplist and an Indexable skiplist
Awarded Dec 6 '19 at 5:15
Confused with the proof that Edmonds-Karp always monotically increases the shortest-paths
Awarded Dec 5 '19 at 16:30
Maximum number of augmenting paths in a network flow
Awarded Dec 5 '19 at 12:50
Is there any other computation theory besides the one in automata theory?
Awarded Dec 5 '19 at 0:40
Hausdorff distance between two binary images according to distance maps
Awarded Dec 3 '19 at 18:15
Is there a well-known algorithm for arranging inputs according to their category?
Awarded Dec 2 '19 at 12:45
Multiple choice knapsack dynamic programming
Awarded Nov 30 '19 at 16:50
Regular expression containing lambda
Awarded Nov 30 '19 at 13:55
How can I solve this deadlock related problem mathematically?
Awarded Nov 29 '19 at 14:45
Dividing unequal parts as equaly as possible
Awarded Nov 28 '19 at 18:35
Bayes theorem probaility doesn't make sense
Awarded Nov 28 '19 at 17:30
Difference between dynamic loading and dynamic linking in the OS
Awarded Nov 27 '19 at 23:25
Is $n^{1/\log \log n} = O(1)$?
Awarded Nov 27 '19 at 8:50
Maximum value of arbitrage
Awarded Nov 27 '19 at 7:55
Which Grows Faster: Factorial or Double Exponentiation
Awarded Nov 26 '19 at 5:20
(post deleted or otherwise unavailable)
Awarded Nov 25 '19 at 15:25
Time Complexity: Why does $n^n$ grow faster than $n!$?
Awarded Nov 25 '19 at 12:30
Is O((n^2)*log(n)) greater than O(n^(2.5))?
Awarded Nov 25 '19 at 6:50
Is O((n^2)*log(n)) greater than O(n^(2.5))?
Awarded Nov 24 '19 at 22:15
Is O((n^2)*log(n)) greater than O(n^(2.5))?
Awarded Nov 24 '19 at 22:00
Recursive Call Inside Argument List (C++)
Awarded Nov 23 '19 at 11:25
How to find a path that connects all the dots in the matrix?
Awarded Nov 22 '19 at 20:55
Is finding the minimum feedback arc set on graph with two outgoing arcs for each node np-complete?
Awarded Nov 21 '19 at 15:30
Is this solution to the dining philosopher's problem entirely valid?
Awarded Nov 21 '19 at 9:45
Is every X3SAT instance with no cycles satisfiable?
Awarded Nov 21 '19 at 6:55
How do we construct reductions for NP-Completeness
Awarded Nov 20 '19 at 22:10
(post deleted or otherwise unavailable)
Awarded Nov 20 '19 at 11:20
Are there any proofs of exponential lower bound time complexity
Awarded Nov 20 '19 at 7:00
turing machine logic instead of something
Awarded Nov 19 '19 at 12:50
Modified Linear Bounded Automata Language
Awarded Nov 18 '19 at 17:50
Why not to take the unary representation of numbers in numeric algorithms?
Awarded Nov 18 '19 at 6:25
1 2 3 4 5 … 78