Computer Science

Editor

 Editor
First edit.
Awarded 13265 times.
how to prove correctness of this BFS algorithm?
Awarded 29 mins ago
Is it possible to construct a C^5(U) with V^2=U and no work qubits (Nielsen & Chuang Exercise 4.28)
Awarded 29 mins ago
Conditional Dependency of Markov model
Awarded 7 hours ago
How to get the calculate the binary logarithm of a fixed-point number with 18 decimals?
Awarded 21 hours ago
Why are binary numbers sometimes written with one or more leading zeros that don't change the number (quantity) represented?
Awarded 21 hours ago
Number of paths starting from a given edge using adjacency matrix
Awarded yesterday
Diagram to represents words having as many $0$ as $1$
Awarded yesterday
(post deleted or otherwise unavailable)
Awarded 2 days ago
(post deleted or otherwise unavailable)
Awarded 2 days ago
Sub-matrix with minimum size of k and minimum sum
Awarded 2 days ago
Necessary or useful models/techniques for simulating natural evolution?
Awarded 2 days ago
Time Complexity: Show the following problem belongs to FP
Awarded 2 days ago
language L=<E,n> E is an enumerator, n is a number
Awarded Apr 9 at 13:27
What is the definition of P, NP, NP-complete and NP-hard?
Awarded Apr 9 at 13:05
How to remove epsilon production from this Context Free Grammar?
Awarded Apr 9 at 12:48
Converse of (two sets are RE => their union is RE) doesn't hold?
Awarded Apr 9 at 3:15
How does strong NP-completeness agree with encoding complexity?
Awarded Apr 8 at 18:56
Convert NFA to DFA
Awarded Apr 8 at 7:02
How can a one-counter machine accept $a^n b^n c^n$?
Awarded Apr 7 at 19:00
is there a constructive proof of the existence of a language which isn't recursive (without invoking infinities)?
Awarded Apr 7 at 14:42
Why is KMP preprocessing O(N)?
Awarded Apr 7 at 9:47
How to find the largest power of two divisor of a given integer?
Awarded Apr 6 at 19:23
(post deleted or otherwise unavailable)
Awarded Apr 6 at 18:27
(post deleted or otherwise unavailable)
Awarded Apr 6 at 17:18
Proving NP-hardness of Hamiltonian Cycle problem variant
Awarded Apr 6 at 15:02
Proving that the shortest simple path problem between two vertices $s$ and $t$ in a graph is NP-complete
Awarded Apr 6 at 8:02
FPT algorithm for 1-BDD
Awarded Apr 6 at 6:21
(post deleted or otherwise unavailable)
Awarded Apr 5 at 10:51
How can I make my algorithm more efficient?
Awarded Apr 5 at 9:11
Grouping Algorithm By Multiple Fields
Awarded Apr 5 at 8:34
(post deleted or otherwise unavailable)
Awarded Apr 5 at 5:56
Minimal number of unions of sets such that no union has more than N elements
Awarded Apr 5 at 5:06
Theta bound for runtime analysis of nested while loops
Awarded Apr 5 at 1:10
Write the Context free Grammar
Awarded Apr 4 at 11:20
Raising to the T in machine learning
Awarded Apr 4 at 10:10
(post deleted or otherwise unavailable)
Awarded Apr 4 at 6:43
Floyd's Cycle detection algorithm | Determining the starting point of cycle
Awarded Apr 4 at 6:15
What is a forwarding pointer? [closed]
Awarded Apr 4 at 5:51
Irregularity of $\{ w_1 aa w_2 \mid |w_1| \neq |w_2| \}$
Awarded Apr 4 at 1:26
Which features can be considered for neural network based SAT solving?
Awarded Apr 3 at 21:41
(post deleted or otherwise unavailable)
Awarded Apr 3 at 21:31
Self-balancing BST supporting in-order-sequential multi-insertions / multi-deletions in logn+klogk time?
Awarded Apr 3 at 18:18
NP as the set of polynomial verifier and set of decidable problem in nondeterministic polynomial time
Awarded Apr 3 at 12:48
(post deleted or otherwise unavailable)
Awarded Apr 3 at 12:10
How to solve recurrence of a binary tree
Awarded Apr 3 at 11:35
Iterated multiplication of permutation matrices
Awarded Apr 2 at 18:52
Pumping lemma for an involved non context free language
Awarded Apr 2 at 12:42
(post deleted or otherwise unavailable)
Awarded Apr 2 at 12:10
(post deleted or otherwise unavailable)
Awarded Apr 2 at 7:02
Relational Algebra: existential quantifiers
Awarded Apr 1 at 22:51
File compression using prime numbers
Awarded Apr 1 at 21:30
(post deleted or otherwise unavailable)
Awarded Apr 1 at 18:57
Construct a Deterministic Pushdown Automaton for unequal number of elements
Awarded Apr 1 at 18:50
What's the difference between a Generalized Nondeterministic Finite Automaton (GNFA) and a Generalized Transition Graph (GTG)?
Awarded Apr 1 at 14:57
Is squaring easier than multiplication?
Awarded Apr 1 at 10:10
Variant of assignment problem
Awarded Mar 31 at 17:16
(post deleted or otherwise unavailable)
Awarded Mar 31 at 11:32
Proving non-regularity of $\{a^p \mid p \in \text{Prime} \}$ without pumping lemma
Awarded Mar 30 at 23:07
Classify as Regular, Decidable, or Acceptable
Awarded Mar 30 at 21:47
Sorting n weight disks with decision tree
Awarded Mar 30 at 18:25
1
2 3 4 5
…
222

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.