Computer Science

Enlightened

 Enlightened
First to answer and accepted with score of 10 or more. This badge can be awarded multiple times.
Awarded 1134 times.
Computational complexity of calculating mean vs median?
Awarded Nov 25 at 18:11
Randomized and deterministic reduction
Awarded Nov 20 at 14:10
Is there a known polynomial time complexity problem with bad constants?
Awarded Nov 10 at 21:56
reduction from 3-SAT to Subset Sum problem
Awarded Nov 5 at 19:40
Algorithmic Complexity of Recognizing Claw-Free Graphs
Awarded Nov 5 at 8:55
Representing binary functions with a finite gate set without exponential blow-up?
Awarded Nov 3 at 8:17
What is the origin of dot notation?
Awarded Nov 2 at 8:32
Peer grading design - choosing a graph, to get accurate rankings/ratings
Awarded Oct 25 at 20:21
Can a graph problem remain NP-hard when restricted to cycle graphs?
Awarded Oct 10 at 23:41
Is reference counting GC vs. tracing GC a language property or an implementation property?
Awarded Sep 15 at 12:58
Is the language given by the regex (ab)* star-free?
Awarded Sep 12 at 8:26
Can we ever achieve Turing completeness?
Awarded Aug 22 at 12:55
Is the 0-1 Knapsack problem where value equals weight NP-complete?
Awarded Aug 9 at 8:34
Is there an efficient algorithm to find whether an integer is a prime power?
Awarded Aug 4 at 1:35
Why is $\Theta$ notation suitable to insertion sort to describe its worst case running time?
Awarded Aug 2 at 5:19
Introduction into first order logic verification
Awarded Jul 20 at 1:18
Choosing a subset to maximize the minimum distance between points
Awarded Jul 5 at 16:11
Why are Chess, Mario, and Go not NP-complete?
Awarded Jun 26 at 23:18
How does the TLB identify a particular process?
Awarded Jun 26 at 6:27
Is a machine Turing-complete when it can decide a context-sensitive language?
Awarded Jun 14 at 4:51
Is there an example of a recursive language which is not context sensitive?
Awarded Jun 13 at 16:37
Are there any type constructors which are *not* functors?
Awarded Jun 6 at 18:26
Are "computable problem" and "computable function" the same thing?
Awarded May 30 at 19:02
How can I convert the Turing machine the recognizes language $L$ into an unrestricted grammar?
Awarded May 28 at 6:17
Are all DFAs also NFAs?
Awarded May 27 at 3:27
What is the complexity of theorem proving?
Awarded May 15 at 10:17
Does the Turing test have anything to do with Turing completeness or Turing machines?
Awarded May 14 at 19:45
Why is PH in PSPACE?
Awarded Apr 28 at 3:12
Measuring time complexity in the length of the input v/s in the magnitude of the input
Awarded Apr 19 at 18:21
baz_num_elts exercise from Software Foundations
Awarded Apr 9 at 15:07
NP-completeness: Reduce to or reduce from?
Awarded Mar 28 at 2:50
What is the difference between a R-tree and a BVH?
Awarded Mar 16 at 10:17
Strictness in both arguments but not in each individually
Awarded Mar 16 at 10:17
Can we transfer every DFA to DFAs with start state having no in edge?
Awarded Mar 14 at 19:05
Is there a "Standard Algorithm" language, as used in academic papers?
Awarded Mar 14 at 15:45
Absorption Law Proof by Algebra
Awarded Mar 13 at 18:47
Given computable function, what are conditions for computability of inverse function?
Awarded Mar 12 at 12:47
Ackermann Function without Recursion or Stack
Awarded Feb 28 at 19:04
What is the difference between the Mogensen-Scott and the Boehm-Berarducci encoding for ADTs on the Lambda Calculus?
Awarded Feb 28 at 2:37
What are the hardest problems that are in P if and only if P=NP?
Awarded Feb 16 at 4:18
Difference between diameter of a graph vs longest path of the graph
Awarded Feb 10 at 14:33
Detecting if three Turing Machines halt given a magic oracle that is only used twice
Awarded Feb 1 at 17:08
How does the linker know where to look for a function implementation in C++?
Awarded Jan 31 at 22:56
Normalized measure from dynamic time warping
Awarded Jan 27 at 2:05
Does an algorithm's space complexity include input?
Awarded Jan 25 at 11:30
Algorithm to search substring in a circular string?
Awarded Jan 19 at 11:32
In algorithms for matrix multiplication (eg Strassen), why do we say n is equal to the number of rows and not the number of elements in both matrices?
Awarded Jan 17 at 23:32
Correctness of FIPS 186-4 square test algorithm
Awarded Jan 17 at 19:52
No Naive Set Theoretic Models of Polymorphic Lambda Calculus?
Awarded Jan 16 at 20:57
What if a formal grammar cannot be terminated?
Awarded Jan 16 at 9:07
In a directed acyclic graph, what do you call the nodes with in-degree zero?
Awarded Jan 10 at 9:34
Does spectral graph theory say anything about graph isomorphism
Awarded Jan 9 at 12:48
Paint a Cube by rolling it (Puzzle Algorithm)
Awarded Dec 30, 2022 at 15:30
Can we prove that any set of finite strings without substrings is finite?
Awarded Dec 27, 2022 at 19:57
Lambda Calculus: How do evaluation contexts "work"
Awarded Dec 25, 2022 at 21:42
What is a partially computable function?
Awarded Dec 21, 2022 at 9:10
A monad is just a monoid in the category of endofunctors, what's the enlightenment?
Awarded Dec 13, 2022 at 13:32
lambda calculus as a type theory
Awarded Dec 12, 2022 at 6:20
What is a CPU clock physically?
Awarded Dec 11, 2022 at 10:26
Proof that for 2n nodes of +1 and -1 position doesn't count
Awarded Nov 29, 2022 at 23:01
1
2 3 4 5
…
19

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.