Skip to main content
Computer Science

Revival

 Revival
Answer more than 30 days after a question was asked as first answer scoring 2 or more. This badge can be awarded multiple times.
Awarded 1224 times.
A Turing machine with each cell accessed at most $10$ times has an equivalent NFA
Awarded Aug 29 at 13:35
Why does ISA includes instruction for logical operation?
Awarded Aug 22 at 18:01
The Power of Randomized Reduction
Awarded Aug 19 at 4:56
What happens if we change $\mathcal{BQP}$ to allow quantum bits, but not quantum gates?
Awarded Aug 17 at 10:19
Can you insert into sorted list with time O(1)?
Awarded Aug 11 at 17:51
how to get rows with more than 1 appearance of a specific column in relational algebra
Awarded Aug 11 at 0:56
Problem of constructing binary sequence with least possible 1s under given constraint
Awarded Aug 9 at 20:47
Why must 2 distinct strings go to the same state in a DFA?
Awarded Aug 7 at 19:26
How does a minimal DFA ensure minimal computational cost?
Awarded Aug 5 at 3:35
Relative running times of equivalent Turing machines with arbitrary and binary alphabets
Awarded Aug 3 at 2:45
Interpreting camera matrix
Awarded Jun 29 at 16:45
Why does a CRC detect burst errors of longer than r+1 bits independently of burst length?
Awarded Jun 26 at 18:31
Find the darkest region in the sky
Awarded Jun 24 at 19:17
Call-by-push-value vs Fine-grain Call-by-value
Awarded Jun 23 at 20:09
Prove that a hamiltonian DAG has a single topological sort
Awarded Jun 15 at 10:21
Confused with the proof that Edmonds-Karp always monotically increases the shortest-paths
Awarded Jun 11 at 2:51
How would a CPU designed purely for functional programming be different?
Awarded Jun 5 at 16:56
Is machine epsilon the largest relative error in representing a number as a floating point number?
Awarded Jun 4 at 1:36
Explanation of a simple example of how an interaction net computes?
Awarded Jun 4 at 1:16
Simple example of exponential gap between monotone and non-monotone circuits
Awarded May 28 at 17:50
Shortest path with odd weight
Awarded May 2 at 15:10
Asymptotic time complexity for finding maximum element in an array
Awarded Apr 21 at 16:55
Efficient algorithm to compute the Heesch number of a shape
Awarded Apr 19 at 14:16
Dataflow Analysis: Available Expressions, why is OUT[B] initialized to universal set?
Awarded Apr 19 at 7:16
Regular expression vs rational expression
Awarded Apr 15 at 9:11
Invertability of Karp reductions
Awarded Apr 15 at 7:07
Length of the certificate in complexity classes
Awarded Apr 7 at 11:36
Flow graph that requires pushing back flow in Ford Fulkerson
Awarded Apr 7 at 10:22
Two Vs Dual Port RAM
Awarded Mar 31 at 3:26
Are all instructions eventually converted to zero-operand instructions?
Awarded Mar 30 at 2:41
How does the half-integer spanning-tree problem contain the TSP?
Awarded Mar 28 at 16:30
Nodes reached with exactly $k$ steps in an undirected graph?
Awarded Mar 28 at 13:27
Is it possible to encode logical expression and interpret it with SQL?
Awarded Mar 19 at 10:48
Refine quickselect with Median of Medians to deal with duplicates
Awarded Mar 14 at 14:47
Are there problems in NP that would solve P vs NP, but are not NP complete
Awarded Mar 12 at 16:33
Max flow algorithm for floating-point weights and E~=10*V
Awarded Mar 12 at 14:03
What's the relationship between "semantic type soundness" and "functional correctness"?
Awarded Mar 11 at 21:48
O(m) time algorithm to check for a strongly connected graph
Awarded Mar 11 at 12:55
Proving why decreasing an edge weight in a graph may change it's MST by one edge
Awarded Mar 4 at 13:40
Uniform generation of random bipartite bi-regular graphs?
Awarded Feb 29 at 13:01
Named outputs of a function
Awarded Feb 28 at 21:10
Alternatives to SVD for rank factorization
Awarded Feb 24 at 7:56
Is the ABC-partition problem NP-hard?
Awarded Feb 23 at 17:12
Name of class of errors where the real state differs from the recorded state?
Awarded Feb 21 at 18:35
Convert the given NFA to DFA
Awarded Feb 21 at 12:11
What is the asymptotic bound for $T(n)= 3T(\sqrt[3]{n})+n^3$?
Awarded Feb 21 at 12:11
A Turing machine for which it is impossible to predict whether it halts or not on a fixed input
Awarded Feb 12 at 13:07
What is the definition of a redex and what are they for in programming languages literature?
Awarded Feb 9 at 6:47
Can the loops be in any order in the Floyd-Warshall algorithm?
Awarded Feb 5 at 12:33
Optimal flow in a network with non-constant edges' weights
Awarded Feb 1 at 12:55
Mapping reducibility from recursive to recursively enumerable language
Awarded Jan 23 at 22:57
Easy proof of IP ⊆ PSPACE for private coins
Awarded Jan 23 at 20:56
Is there such a thing as $coW[1]$-hardness?
Awarded Jan 14 at 5:02
Proving that $(A \cup B)^* = A^*(BA^*)^*$
Awarded Jan 13 at 1:09
ALL_{NFA} is PSPACE-complete
Awarded Jan 13 at 1:04
Is the set of all DFAs countable?
Awarded Jan 12 at 22:12
How to remove null production from context free grammar?
Awarded Jan 11 at 16:41
Finding missing edge weights in the context of minimum spanning tree
Awarded Jan 11 at 15:07
How to prove that {<M1, M2> : M1 and M2 are two DFAs and L(M1) $\neq$ L(M2)} is in NL?
Awarded Jan 6 at 20:48
Find a node with maximum distance from query node in a tree
Awarded Jan 1 at 22:35
1
2 3 4 5
…
21