Computer Science

Help Center > Badges > Excavator

 Excavator
Edit first post that was inactive for 6 months.
Awarded 346 times.
Properties of Reverse Polish Notation expressions that are algebraically invariant
Awarded 2 days ago
STCON is NL complete - but why is the reduction in L?
Awarded Jul 3 at 4:10
Why is deep learning hyped despite bad VC dimension?
Awarded Jun 28 at 4:05
Finding minimum spanning tree with O(|V|)
Awarded Jun 27 at 4:05
How did the Logic Theorist prove the Pons Asinorum?
Awarded Jun 26 at 5:00
What is meant by superlinear speedup? Is it possible to have superlinear speedup in practice?
Awarded Jun 26 at 5:00
Does there exist a finite automaton for the given language?
Awarded Jun 24 at 4:25
Can regular languages be Turing complete?
Awarded Jun 14 at 4:10
How to prove that a language is not recursively enumerable
Awarded Jun 7 at 5:10
Divide N sticks among M boys as evenly as possible
Awarded Jun 2 at 4:05
What is oblivious RAM and how does it work?
Awarded May 25 at 4:20
Trying to show if two languages are recognizable or not
Awarded May 23 at 4:06
Does precedence matter in constructing parse trees of arithmetic expressions for postfix notation?
Awarded May 22 at 4:20
Polygon casting - Removing from mold by rotation
Awarded May 2 at 4:25
Clustered Regions by Each Neuron in Self Organizing Map (SOM)
Awarded May 2 at 4:25
Is automatic multicore support at the hardware or compiler level possible?
Awarded Apr 30 at 5:05
Prove that a language is not regular with process of elimination [duplicate]
Awarded Apr 28 at 4:25
KMP - longest palindromic prefix
Awarded Apr 27 at 4:25
How can it be decidable whether $\pi$ has some sequence of digits?
Awarded Apr 24 at 5:35
Teaching Recursion
Awarded Apr 23 at 6:05
Description of shape in a vector form
Awarded Apr 22 at 6:10
Order of a leaf node in B+ Tree
Awarded Apr 17 at 4:15
Definition of an immune set
Awarded Apr 5 at 4:55
Amdahl's law or gustafson's law
Awarded Apr 5 at 4:55
FM-index - print all patterns
Awarded Mar 26 at 5:25
Turing Machine remembering copied symbols
Awarded Mar 22 at 4:05
Problem with definition of bisimilarity
Awarded Mar 20 at 5:45
How many different max-heaps exist for a list of n integers?
Awarded Mar 15 at 4:15
What is the time complexity of calling successor $n$ times during tree traversal?
Awarded Mar 14 at 4:10
Interesting problem on tree
Awarded Mar 13 at 4:45
Multi-point evaluations of a polynomial mod p
Awarded Mar 7 at 4:10
Definition of an immune set
Awarded Mar 4 at 5:25
How was Idris' `rewrite` implemented?
Awarded Mar 2 at 5:05
Understanding Bellman-Ford and Floyd-Warshall Algorithms as Dynamic Programming Algorithms
Awarded Feb 25 at 4:10
Approximating maximal independent set with a minimal vertex cover approximation
Awarded Feb 23 at 4:40
Why do these recurrences determine the number of ways of tiling a 3xN rectangle with 2x1 dominoes?
Awarded Feb 20 at 4:45
LR(0) parsing: how can I know sets of items corresponding to states?
Awarded Feb 19 at 4:10
How to generate an LL(2) parse table?
Awarded Feb 12 at 4:25
How does one find a non-quadratic residue modulo $p$?
Awarded Jan 24 at 18:45
Randomized algorithm for 3SAT
Awarded Jan 14 at 5:25
Explaination for Variation of Boyer-Moore Majority voting algorithm
Awarded Jan 10 at 5:00
What can be learned from the weights in a neural network?
Awarded Jan 9 at 4:05
NP-hard proof: Polynomial time reduction
Awarded Jan 8 at 4:15
Enumerating all n-tuples over a finite domain
Awarded Jan 7 at 5:05
Is the system of measuring length in the US Turing complete?
Awarded Jan 5 at 4:15
Why is integer programming more difficult than (real) linear programming?
Awarded Jan 4 at 5:25
Not all Red-Black trees are balanced?
Awarded Dec 26 '18 at 6:45
Largest possible cost of a shortest path in which every edge's length is either -1, 0, or 1
Awarded Dec 23 '18 at 4:10
What defines a tool as a “compiler”
Awarded Dec 18 '18 at 5:15
Minimum spanning tree of a connected induced subgraph
Awarded Dec 18 '18 at 5:15
Calculating the end-to-end delay of a message sent over a network
Awarded Dec 16 '18 at 4:30
Steiner tree problem with the known optimal subset of Steiner vertices in approximation algorithms
Awarded Dec 14 '18 at 4:40
Simplifying a boolean expression
Awarded Dec 5 '18 at 5:40
Difference between conflict serializability and view serializability
Awarded Dec 1 '18 at 4:15
Big O understanding given different input sizes
Awarded Nov 29 '18 at 13:55
Can't understand why the DP Subset Sum algorithm is not polynomial
Awarded Nov 29 '18 at 5:05
What is the complexity for the universality problem for a NFA with all states accepting?
Awarded Nov 28 '18 at 4:30
Why is b-tree search O(log n)?
Awarded Nov 28 '18 at 4:30
Is the set of all strings over a finite alphabet finite? [closed]
Awarded Nov 11 '18 at 4:05
Complexity class NP and MA
Awarded Oct 31 '18 at 4:10
1 2 3 4 5 6