Skip to main content
Computer Science

Self-Learner

 Self-Learner
Answer your own question with score of 3 or more.
Awarded 271 times.
Random directed acyclic graph (Barak-Erdös): find "upstream" vertices
Awarded Jul 9 at 10:36
What is the "shortest path heuristic" for the Steiner problem in graphs?
Awarded Apr 1 at 1:27
Does Either...Or means Exclusive Or or Inclusive Or?
Awarded Mar 13 at 10:16
Understanding proof for Busy Beaver being uncomputable
Awarded Mar 10 at 9:41
How to find a "short" walk that visits all vertices of a strongly connected directed graph
Awarded Feb 20 at 12:46
Is there a formal way of defining a Zeno Machine?
Awarded Jan 18 at 2:56
How to solve Tower of Hanoi iteratively?
Awarded Dec 18, 2023 at 6:17
Proof that the existence of a Hamilton Path in a bipartite graph is NP-complete
Awarded Dec 10, 2023 at 12:58
What is instruction throughput and instruction latency?
Awarded Nov 23, 2023 at 15:05
Abstract Interpretation: prove that the sign subtraction is increasing in each of its parameters
Awarded Oct 18, 2023 at 1:20
How to setup the Bellman Equation as a linear system of equation
Awarded Oct 11, 2023 at 4:52
How does Tarjan's pseudocode work (explained to someone familiar with C or Java)?
Awarded Aug 10, 2023 at 14:09
How to verify number with Bob without Eve knowing?
Awarded Aug 3, 2023 at 7:32
Abstract Interpretation: Connection between soundness relation and a Galois connection
Awarded Jul 4, 2023 at 21:07
Algorithm for length of longest common subsequence
Awarded Jun 15, 2023 at 22:45
Is Monotone 3-SAT with exactly 3 distinct variables untractable?
Awarded May 31, 2023 at 4:05
Brzozowski's algorithm for Kleene star NFA
Awarded Apr 14, 2023 at 17:46
Traversing a graph in finite time, maximizing utility
Awarded Dec 16, 2022 at 17:05
Is every $p$th word in a regular language regular?
Awarded Sep 4, 2022 at 21:41
Find number of nodes that seperate graph to two or more subgrahps when removed individually - Find articulation points on a non-directed graph
Awarded Aug 23, 2022 at 16:32
Why do we do topological sorting to find shortest or longest path in weighted DAG?
Awarded Jul 25, 2022 at 11:34
Have I invented a new data structure?
Awarded Jun 29, 2022 at 3:10
Number of Inversions found in Selection sort vs Exchange sort
Awarded May 7, 2022 at 1:51
$k$-Opt TSP Local Search is exact when $k = |V| - 1$
Awarded Apr 12, 2022 at 18:25
Is it possible to entangle more than 2 qubits? If so, is it useful?
Awarded Mar 28, 2022 at 10:11
Finding all marked elements using Grover's algorithm
Awarded Feb 12, 2022 at 16:15
Is there any way to distinguish between LL(k) and LR(k) grammar?
Awarded Feb 3, 2022 at 10:47
Generating Isomorphic Graphs
Awarded Jan 5, 2022 at 5:10
What edges are not in a Gabriel graph, yet in a Delauney graph?
Awarded Dec 27, 2021 at 16:50
Is this set covering problem NP-Hard?
Awarded Dec 12, 2021 at 20:01
Are there any hash functions/stateless RNGs that do not use XOR, but produce good quality visual randomness?
Awarded Dec 3, 2021 at 1:41
Matching two noisy / lossy versions of the same data stream to each other
Awarded Oct 29, 2021 at 6:27
How does SpaCy make its dependency tree?
Awarded Aug 18, 2021 at 9:19
$L$ is a context free language so prefix$(L)$ is also a context free language
Awarded Aug 8, 2021 at 19:11
Is "represents" a symmetric relation in the provided answer to TAOCP exercise 1.1.9?
Awarded Jul 19, 2021 at 5:15
Interpolation on marching cubes algorithm
Awarded Jun 2, 2021 at 6:06
Randomly built binary search trees
Awarded Jan 26, 2021 at 20:30
What do Arora and Barak mean by $x|_S$ in their definition of certificate complexity?
Awarded Jan 20, 2021 at 0:46
Efficient point grouping algorithm
Awarded Jan 7, 2021 at 15:19
Enumerating all partial permutations of given length in lexicographic order
Awarded Dec 27, 2020 at 17:18
Why is the language of even-length non-palindromes context-free?
Awarded Dec 24, 2020 at 21:45
Name of binary encoding scheme for integer numbers
Awarded Dec 10, 2020 at 20:41
Unambiguous grammar for regular expressions
Awarded Dec 5, 2020 at 17:20
Construct a CFG for $L = \{ w \in \{0,1\}^*\text{ } |\text{ } w = w^R \text{ and } |w| \text{ is even}\}$
Awarded Dec 2, 2020 at 17:34
How to iterate the Hardy-Ramanujan integers quickly
Awarded Nov 1, 2020 at 15:41
optimal testing strategy
Awarded Oct 31, 2020 at 2:36
Undecidability of "is this CFG prefix-free?"
Awarded Oct 12, 2020 at 4:26
How do we derive the runtime cost of Karatsuba's algorithm?
Awarded Sep 12, 2020 at 7:21
Interactive programming language minimizing reevaluations
Awarded Sep 8, 2020 at 2:04
using orientation sensor data to predict image points
Awarded Aug 22, 2020 at 0:30
Approximation with imperfect dichotomy oracle
Awarded Aug 18, 2020 at 19:40
Max flow with priorities
Awarded Aug 6, 2020 at 13:48
Is it possible to solve the Mountain Car reinforcement learning task with linear Q-Learning using the state as direct input?
Awarded Aug 5, 2020 at 17:42
If $A$ is context-free then $A^*$ is regular
Awarded Jul 25, 2020 at 18:51
How to avoid having to store extra information about padding (for byte size alignment) with Huffman coding
Awarded Jun 19, 2020 at 14:56
Karp reduction from PARTITION to SUBSET SUM
Awarded Jun 10, 2020 at 14:32
What is the time complexity Big-O of this algorithm?
Awarded May 13, 2020 at 8:37
Are the languages recognized by deterministic one-counter machines equivalent to deterministic context free language?
Awarded May 9, 2020 at 0:03
fast and stable x * tanh(log1pexp(x)) computation
Awarded May 3, 2020 at 7:16
Eliminating cycles from a grammar
Awarded Feb 26, 2020 at 19:25
1
2 3 4 5