Skip to main content
Computer Science

Necromancer

 Necromancer
Answer a question more than 60 days later with score of 5 or more. This badge can be awarded multiple times.
Awarded 538 times.
Proof that a language involving $gcd$ is not context-free
Awarded 2 days ago
Proving that the scramble of a regular language is context-free
Awarded Jul 12 at 5:05
What are very short programs with unknown halting status?
Awarded Jul 9 at 20:55
Best data structure for queries about subsets?
Awarded Jul 1 at 8:13
Do relativized relations between complexity classes tell us anything about the nonrelativized relation?
Awarded Jun 2 at 18:00
What is the complexity for the universality problem for a NFA with all states accepting?
Awarded May 31 at 14:26
Decision problems vs "real" problems that aren't yes-or-no
Awarded May 21 at 6:21
Compiler that compiles to a Turing machine?
Awarded May 19 at 17:42
What is the fastest algorithm for multiplication of two n-digit numbers?
Awarded May 10 at 5:16
What does "associative" exactly mean in "n-way set-associative cache"?
Awarded Apr 17 at 0:33
How does hardware interrupt work on a physical layer
Awarded Apr 15 at 10:36
Flow graph that requires pushing back flow in Ford Fulkerson
Awarded Apr 12 at 5:16
Are there problems in NP that would solve P vs NP, but are not NP complete
Awarded Apr 9 at 13:40
Is there any practical trick to mentally count in Gray code?
Awarded Mar 29 at 2:06
Prove that finding largest subset of undirected graph that is almost independent is NP-hard
Awarded Mar 28 at 15:16
Demonstrate that DPDA is closed under complement by construction
Awarded Mar 26 at 17:00
Edge contraction in DAG
Awarded Mar 17 at 3:52
Are there real lexers that use NFAs directly instead of first transforming them to DFAs?
Awarded Mar 7 at 11:57
How to prove every context-free language over a unary alphabet is regular?
Awarded Mar 2 at 20:08
Do Karnaugh maps yield the simplest solution possible?
Awarded Feb 17 at 17:34
Depth of any node x in Weighted Quick-Union Algorithm
Awarded Dec 27, 2023 at 11:34
The math behind converting from any base to any base without going through base 10?
Awarded Dec 19, 2023 at 21:18
Dynamic Programming vs Memoization
Awarded Nov 27, 2023 at 16:21
Why is quicksort better than other sorting algorithms in practice?
Awarded Nov 12, 2023 at 14:20
Why are Red-Black trees so popular?
Awarded Nov 2, 2023 at 20:27
What are the advantages of x86 CPUs over ARM?
Awarded Oct 30, 2023 at 18:27
Sorting functions by asymptotic growth
Awarded Oct 19, 2023 at 11:09
The equivalence relations cover problem (in graph theory)
Awarded Sep 26, 2023 at 4:41
Smallest set of features that would make relational algebra Turing complete
Awarded Sep 25, 2023 at 16:11
A faster, leaner JavaScript for scientific computing: what features should I keep?
Awarded Sep 14, 2023 at 5:27
Quadratic probing maximum load factor with $c_1 = c_2 = 0.5$ to guarantee successful insertion
Awarded Sep 11, 2023 at 5:26
What does the complexity class $\mathsf{XP}$ stand for?
Awarded Jul 26, 2023 at 10:05
Understanding pipeline stalls (bubbles) based on stage
Awarded Jul 11, 2023 at 10:35
Time complexity for count-change procedure in SICP
Awarded Jul 3, 2023 at 9:05
What is a cache write miss?
Awarded Jun 23, 2023 at 21:55
Show that P is closed against the Kleene star
Awarded Apr 23, 2023 at 15:55
Can a total programming language be Turing-complete?
Awarded Apr 18, 2023 at 18:16
Minimum number of clues to fully specify any sudoku?
Awarded Apr 7, 2023 at 15:10
Why is the commit phase in PBFT necessary?
Awarded Apr 6, 2023 at 0:20
Formal program verification in practice
Awarded Mar 3, 2023 at 20:57
Why is it best to use a prime number as a mod in a hashing function?
Awarded Feb 24, 2023 at 1:32
motivation and idea of defining non-deterministic Turing machine
Awarded Jan 12, 2023 at 9:42
Equivalence of data-flow analysis, abstract interpretation and type inference?
Awarded Jan 10, 2023 at 4:42
Equivalence of data-flow analysis, abstract interpretation and type inference?
Awarded Jan 10, 2023 at 4:42
Simple graph canonization algorithm
Awarded Jan 3, 2023 at 0:08
End-Of-The-Line Augmented Problem of PPAD
Awarded Jan 2, 2023 at 18:09
SAT algorithm for determining if a graph is disjoint
Awarded Dec 4, 2022 at 12:04
Are all Turing machines Turing complete?
Awarded Nov 7, 2022 at 9:42
How to prove that a grammar is unambiguous?
Awarded Oct 17, 2022 at 20:56
Why is the A* search heuristic optimal even if it underestimates costs?
Awarded Oct 11, 2022 at 3:26
A* optimality of the expanded node
Awarded Oct 8, 2022 at 23:11
What is a "trap" in the context of system virtualization?
Awarded Sep 9, 2022 at 14:03
Algorithm Request: "Shortest non-existing substring over given alphabet"
Awarded Sep 8, 2022 at 21:22
If the two generals problem is unsolvable how can we human beings agree on things?
Awarded Aug 31, 2022 at 16:15
How to prove: If $\textsf{EXP} \subseteq \textsf{P/poly} $ then $\textsf{EXP} = \Sigma^p_2$
Awarded Aug 22, 2022 at 13:04
Is the language of words containing equal number of 001 and 100 regular?
Awarded Aug 22, 2022 at 11:11
What exactly is Symbolic Model Checking?
Awarded Jul 25, 2022 at 13:33
Why Do Computers Use the Binary Number System (0,1)?
Awarded Jul 24, 2022 at 16:08
Numerical stability of linear interpolation
Awarded Jul 19, 2022 at 14:05
Guided Backpropagation in Deep Neural Networks
Awarded Jul 18, 2022 at 6:32
1
2 3 4 5
…
9