People who code: we want your input. Take the Survey
Computer Science

Teacher

 Teacher
Answer a question with score of 1 or more.
Awarded 5404 times.
What's an Instruction Set Architecture
Awarded 8 hours ago
Haskell type classes as ontological categories
Awarded 18 hours ago
Does $NP^{SAT}=NP^{NP}$?
Awarded 2 days ago
Is $L=\{\langle M\rangle\mid L(M)\subseteq HP\}\in coRE$?
Awarded Jun 8 at 13:34
Questions on shortest path and minimum spanning tree
Awarded Jun 6 at 7:42
(post deleted or otherwise unavailable)
Awarded Jun 2 at 21:25
Google Foobar Level 4 - Graph Problem
Awarded Jun 2 at 8:27
Connected Vertex Cover
Awarded Jun 1 at 12:16
Is there any study or theory behind combining binary search and interpolation search?
Awarded Jun 1 at 12:16
Solving $T(n)=3T\bigl(\bigl\lfloor \frac{n}{3}\bigr\rfloor\bigr) +2n\log n$ without the Master Theorem
Awarded Jun 1 at 4:56
What is the advantage of probability algorithm?
Awarded May 30 at 2:02
How to show that pda accepts empty language?
Awarded May 29 at 9:56
Algorithm to distribute items “evenly”
Awarded May 29 at 8:01
What is a good path for self-study of CS foundations/fundamentals?
Awarded May 29 at 5:20
What is “dynamic” about dynamic programming?
Awarded May 28 at 22:27
Uniform sampling from a simplex
Awarded May 27 at 12:42
Correctness of Strongly Connected Components algorithm for a directed graph
Awarded May 27 at 6:36
What is the minimal degree $d$ required for a B tree with $44*10^6 $ keys so that it's height is less than or equal to $5$
Awarded May 26 at 14:42
Is the following problem NP-Complete?
Awarded May 25 at 2:37
$(\log n)^{\log n}$ lower-bound and upper-bound
Awarded May 24 at 21:27
In the FLP Impossibility paper, why did the authors claim that e is applicable to every E in proof of lemma 3?
Awarded May 24 at 7:55
Generate 3D “matrix” with Pandas, based on comparing two dataframes [Python]
Awarded May 22 at 19:02
Cardinality of the set of algorithms
Awarded May 20 at 6:02
Creating a large tuple from smaller tuples via a monad or applicative
Awarded May 19 at 19:51
Algorithm for computing the sum of symmetric sums (better than $\mathcal{O}(2^N)$ )
Awarded May 19 at 18:07
Prove that the language represented having equal number of $0$'s and $1$'s and starting with a $0$ is not regular
Awarded May 18 at 22:06
DAG: When adding an edge that would normally result in a cycle, is there an algorithm to split the graph instead?
Awarded May 18 at 16:19
Dynamic Programming - Tiling Question
Awarded May 17 at 20:47
Prove $\{xy \mid |x|=|y|, x \neq y\}$ is not a linear language
Awarded May 17 at 11:04
How to answer the following queries on a tree?
Awarded May 15 at 14:50
Is there any practical trick to mentally count in Gray code?
Awarded May 15 at 9:42
Is there any practical trick to mentally count in Gray code?
Awarded May 15 at 9:34
Why can't one use the Cook-Levin theorem to show that TQBF is PSPACE-complete?
Awarded May 15 at 9:27
Reduction from 3SAT to SUBSET-SUM
Awarded May 15 at 9:27
Is the kernel loaded into memory for every user simultaneously using a Multi-User O.S. system?
Awarded May 14 at 19:33
Set theory pertaining to category theory and functional programming
Awarded May 14 at 18:32
Dynamic All Pairs Shortest Paths algorithm
Awarded May 14 at 11:21
In a single cycle datapath, do 'decode' and 'operand fetch' occur simultaneously?
Awarded May 14 at 11:11
What are the minimum and maximum numbers of elements in a heap of height h?
Awarded May 13 at 17:08
How many languages are described by a regular expression?
Awarded May 13 at 1:23
Max no. of keys of B-Tree of height h
Awarded May 12 at 3:16
Why does Python allow stand-alone expressions?
Awarded May 11 at 14:21
What is the “spatial information” in convolutional neural network
Awarded May 11 at 10:33
Why cannot Operand forwarding remove all RAW hazards?
Awarded May 10 at 12:11
Can given grammar be parsed using recursive descent?
Awarded May 9 at 21:04
Are joins/pullbacks of bloom filters possible?
Awarded May 5 at 22:10
“Greater than” condition in integer linear program with a binary variable
Awarded May 5 at 18:05
Sorting by repeated reversal
Awarded May 5 at 6:19
Is there any NP-hard problem which was proven to be solved in polynomial time or at least close to polynomial time?
Awarded May 4 at 12:42
eliminate left recursion of below grammar
Awarded May 4 at 10:04
Is this definition of $\alpha$-equivalence correct?
Awarded May 4 at 6:51
Difference between intended interpretation and extended interpretation in first-order logic
Awarded May 3 at 20:52
Number of comparisons in Binary search
Awarded May 3 at 6:44
LRU vs FIFO page replacement
Awarded May 2 at 23:32
How to translate automatons (Turing machines) into programs of high level programming language?
Awarded May 2 at 14:30
Is there a formal way of defining a Zeno Machine?
Awarded May 1 at 15:43
Is the following problem NP-hard? (or have you seen it before?)
Awarded Apr 29 at 19:28
MOOC recommendations for learning algorithms based on topics covered in Daspupta, Papadimitriou & Vazirani
Awarded Apr 27 at 20:06
Is the following problem NP-hard? (or have you seen it before?)
Awarded Apr 27 at 14:53
Perfect matching in a graph and complete matching in bipartite graph
Awarded Apr 26 at 15:38
1
2 3 4 5
…
91

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.