Computer Science

Teacher

 Teacher
Answer a question with score of 1 or more.
Awarded 5307 times.
Let $G$ be an undirected graph with $n$ nodes. Prove the following
Awarded 2 hours ago
Why are binary numbers sometimes written with one or more leading zeros that don't change the number (quantity) represented?
Awarded yesterday
Time Complexity when there is while loop
Awarded yesterday
Regular expression without 00 as a substring
Awarded 2 days ago
How large is the seed in an encryption algorithm such as stream cipher?
Awarded Apr 9 at 9:50
How can a one-counter machine accept $a^n b^n c^n$?
Awarded Apr 8 at 6:56
Why is KMP preprocessing O(N)?
Awarded Apr 7 at 10:32
Prolog: Deletion of all appearances of an element in a list
Awarded Apr 7 at 6:50
How to find the largest power of two divisor of a given integer?
Awarded Apr 6 at 5:11
Machine Learning vs System Identification?
Awarded Apr 4 at 5:51
Self-balancing BST supporting in-order-sequential multi-insertions / multi-deletions in logn+klogk time?
Awarded Apr 3 at 20:43
Can anyone explain how look-up tables are used for optimal Rubik's cube solvers such as Thistlethwaite's or Kociemba?
Awarded Apr 3 at 4:34
A general picture of formal verification in software
Awarded Apr 2 at 23:11
what is approach of solving MINUS on SPOJ?
Awarded Apr 2 at 13:05
Construct a Deterministic Pushdown Automaton for unequal number of elements
Awarded Apr 2 at 6:47
Random Sudoku generator
Awarded Apr 2 at 6:47
Tightest upper bound on length of distinguishing string in Hopcroft's algorithm
Awarded Mar 31 at 9:34
Proving non-regularity of $\{a^p \mid p \in \text{Prime} \}$ without pumping lemma
Awarded Mar 31 at 8:35
Why is writing down mathematical proofs more fault-proof than writing computer code?
Awarded Mar 30 at 21:08
Language of regular grammar
Awarded Mar 29 at 17:30
Show that LOOP is reducible to Complement of Halting problem
Awarded Mar 28 at 23:33
Augmenting paths of two matchings
Awarded Mar 28 at 14:43
Longest sequence of dominoes
Awarded Mar 27 at 11:08
How to prove NP-hardness of a longest-path problem?
Awarded Mar 26 at 16:51
A data structure that supports efficient insertion of arbitrary integers, value lookup, and removal of all integers smaller than a given threshold?
Awarded Mar 24 at 13:17
Partitions of star-free languages and questions on the proof of the Splitting Lemma by Diekert/Gastin
Awarded Mar 24 at 11:08
Amortized analysis for disjoint sets' find-set(x) function (from CLRS)
Awarded Mar 24 at 8:42
Calculating worklist with live variable analysis
Awarded Mar 24 at 8:36
Building a tree with the heap property from an array and preserving its order
Awarded Mar 24 at 8:36
Why sequential consistency model is widely used if it is unsound
Awarded Mar 24 at 6:31
Are EAX , EBX registers 64 bit in length in modern processors
Awarded Mar 22 at 18:32
Prove REGULAR_TM is undecidable
Awarded Mar 22 at 17:06
Prove that $1^\text{nan} = 1.00$
Awarded Mar 22 at 13:31
Merkle tree sorting leaves and pairs
Awarded Mar 20 at 15:50
What is the best way to merge cycles to minimise total weight?
Awarded Mar 19 at 13:04
parse datetime number in html field
Awarded Mar 17 at 23:18
(post deleted or otherwise unavailable)
Awarded Mar 17 at 12:42
Is there a concept of probabilistic quantum computers?
Awarded Mar 14 at 6:51
Time complexity of min() and max() on a list of constant size?
Awarded Mar 12 at 20:49
Subset of nodes such that all nodes of a graph are adjacent
Awarded Mar 12 at 12:42
Reinforcement learining basics - is it possible to deal with environment with random events
Awarded Mar 12 at 11:15
Is well-founded recursion enough for practical total functional programming?
Awarded Mar 12 at 11:15
Time complexity of min() and max() on a list of constant size?
Awarded Mar 12 at 5:43
Time complexity of min() and max() on a list of constant size?
Awarded Mar 11 at 18:35
Information on Tavori and Dreizin ranged hash function?
Awarded Mar 8 at 14:50
The optimized numbers of variables and clauses to encode a graph coloring problem in CNF
Awarded Mar 8 at 9:10
Can the maximum single sell profit by divide and conquer be O(n)?
Awarded Mar 8 at 6:34
given a weighted, directed graph. Give an O(VE)-time algorithm to find, for each vertex v∈V, the value δ∗(v)=Min u∈V{δ(u,v)}?
Awarded Mar 7 at 21:51
Is there a binary representation where the encoding distance grows with the arithmetic distance?
Awarded Mar 6 at 18:45
A doubt on best media for a time capsule
Awarded Mar 5 at 21:00
Are most metaheuristic algorithms different metaphors for the same method?
Awarded Mar 4 at 12:27
Fast algorithm for interpolating data from polar coordinates to cartesian coordinates
Awarded Mar 3 at 0:02
Why are Red-Black trees so popular?
Awarded Mar 2 at 23:48
Polynomial-time linear-reduction from Directed Hamiltonian Path Problem to 3SAT
Awarded Mar 2 at 9:46
Eliminating left recursion and left factoring this grammar
Awarded Feb 28 at 2:10
How to calculate the number of weights for a CNN?
Awarded Feb 26 at 8:22
Is there a tactic to help resolving existential quantifiers in Coq?
Awarded Feb 26 at 8:22
Compilers: how to find first and follow sets?
Awarded Feb 25 at 8:27
In a DBMS what are the implementation details that make set operations faster than cursors?
Awarded Feb 24 at 18:11
What will a given CPU architecture do in the event that we were to invert all of the instruction bits to a given instruction?
Awarded Feb 24 at 8:51
1
2 3 4 5
…
89

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.