Skip to main content
Computer Science

Teacher

 Teacher
Answer a question with score of 1 or more.
Awarded 6293 times.
How to Prepare for Informatics Olympiad and ACM-ICPC?
Awarded 11 hours ago
Most scalable distributed consensus mechanism based on message complexity?
Awarded 20 hours ago
Accelerating semidecision of halting problem
Awarded yesterday
data flow analysis reaching definition analysis meaning
Awarded 2 days ago
Decision-Version of Linear Programming not in P?
Awarded Jul 18 at 5:32
Interactive Proof for Graphs with No Non-Trivial Automorphisms
Awarded Jul 16 at 23:41
How to prove that this "priority" strategy (in ANTLR4) solves the "dangling-else" ambiguity?
Awarded Jul 16 at 13:32
Find all intervals that are contained in a query interval
Awarded Jul 12 at 21:35
Understanding how to use constants tables for linear congruential generators (LCGs) from two papers on the internet
Awarded Jul 11 at 19:42
Is stable infinity required of theories combined with model-based theory combination?
Awarded Jul 11 at 19:42
Proving that $T(n)=16T\left(\frac{n}{4}\right)+n! \in \Theta(n!)$
Awarded Jul 11 at 3:56
Arora and Barak: Exercise 0.2. (b)
Awarded Jul 9 at 20:05
Runtime of randomization algorithm to find majority element in an array?
Awarded Jul 9 at 10:50
Replacing 0x1021 polynomial with 0x8005 in this CRC-16 code
Awarded Jul 9 at 5:23
In-Place Reordering of Doubly Linked List Nodes to Ensure Memory Contiguity
Awarded Jul 5 at 14:02
Show that the the language $L = \{0^kww0^m | k,m \ge 1, w \in \{0, 1\}^*\}$ is nonregular
Awarded Jul 5 at 5:56
What does it take to support a programming language on an OS?
Awarded Jul 3 at 22:41
How to efficiently code Dynamic Time Warping algorithm with a locality constrain?
Awarded Jul 3 at 18:19
Are dictionaries and associative arrays the same thing?
Awarded Jul 3 at 17:47
Implementing regular expression matching using Brzozowski derivatives
Awarded Jul 3 at 5:17
How to write a turing machine program for any given problem?
Awarded Jul 3 at 5:05
How are epipolar lines useful in computer vision?
Awarded Jun 29 at 18:06
Random directed acyclic graph (Barak-Erdös): find "upstream" vertices
Awarded Jun 28 at 21:55
Is it possible to use a non-Turing-complete language to describe the steps to build a Turing Machine?
Awarded Jun 27 at 1:07
O-notation confusion
Awarded Jun 26 at 23:36
How Tarjan algorithm work for the 2-SAT
Awarded Jun 26 at 14:48
Why the Cook-Levin reduction is not a parsimonious reduction?
Awarded Jun 25 at 11:33
What would show a human mind is/is not reducible to a Turing machine?
Awarded Jun 23 at 12:34
Practical hard 3-sat instances
Awarded Jun 23 at 10:25
Math major looking to learn some CS
Awarded Jun 20 at 16:33
Mapping spherical coordinates onto faces of an icosahedron
Awarded Jun 18 at 18:15
What formula was used here to calculate the average search time of the binary tree?
Awarded Jun 18 at 5:05
How is the prefix function (for KMP) time complexity O(N)?
Awarded Jun 16 at 21:48
Trie minimization when order doesn't matter
Awarded Jun 16 at 10:04
What is the difference between NP=EXP and ETH, and what does the community believe about their truth?
Awarded Jun 15 at 11:25
Why can't we replace Dijkstra's priority queue with a regular queue?
Awarded Jun 15 at 10:16
Design a DFA that accepts even length binary strings that start with 0 and must not contain substring "001"
Awarded Jun 14 at 22:10
Design a DFA that accepts even length binary strings that start with 0 and must not contain substring "001"
Awarded Jun 14 at 17:06
Is there a fully combinatorial version of MLTT without lambda abstraction?
Awarded Jun 13 at 14:51
Given a set $A$ of sets find a minimal set $B$ of pair-wise disjoint sets such that each set in $A$ can be expressed as a union of sets in $B$
Awarded Jun 11 at 12:25
Shortest path with exactly $k$ edges
Awarded Jun 11 at 12:06
TOPS trillion operations per second to Tokens per second
Awarded Jun 9 at 18:42
Detect if an interval is fully covered by union of previous intervals in sequence
Awarded Jun 5 at 23:35
Do analog computers exist?
Awarded Jun 4 at 18:42
Approximation algorithms for integer convex quadratic programs over a linear subspace
Awarded Jun 3 at 7:32
Books to prepare before reading Knuth's The Art Of Computer Programming (TAOCP)
Awarded Jun 2 at 21:31
Is the Tomasi-Kanade factorization still commonly used as a modern computer vision technique?
Awarded May 31 at 9:25
Undecidable problems in finite graphs
Awarded May 30 at 21:27
Is it possible to sort this type of array in O(n) time?
Awarded May 30 at 7:40
Chess Knight minimum moves to destination on an infinite board
Awarded May 28 at 18:51
Are there minimum criteria for a programming language being Turing complete?
Awarded May 28 at 18:45
Simple example of exponential gap between monotone and non-monotone circuits
Awarded May 28 at 16:42
Is the Partition problem polynomial when all integers are large?
Awarded May 27 at 20:36
Applied $\pi$-calculus: Name binding and if clauses
Awarded May 25 at 17:46
Why is my O(n^2 * 2^n) code faster than O(n * 2^n) and O(2^n) codes for the LeetCode "Beautiful Subsets" problem?
Awarded May 25 at 12:07
Using XOR operation, a MOD operation compute a function f(n)
Awarded May 25 at 3:41
Does NSPACE($n^2$) $=$ DSPACE($n^4$)?
Awarded May 25 at 3:41
Why is the Turing machine considered effective computation if it's not realizable due to the Bekenstein bound?
Awarded May 24 at 11:08
Why is the Turing machine considered effective computation if it's not realizable due to the Bekenstein bound?
Awarded May 23 at 6:05
Why is the Turing machine considered effective computation if it's not realizable due to the Bekenstein bound?
Awarded May 22 at 17:21
1
2 3 4 5
…
105