Computer Science

Scholar

 Scholar
Ask a question and accept an answer.
Awarded 9561 times.
How do I use the pumping lemma for a^n b^m a^(n+m) ? How can I choose the pumping length?
Awarded 15 hours ago
Is there a real life example of algorithm that has running time $\Theta(1)$
Awarded 22 hours ago
(Un)computability of a restricted Halting Problem
Awarded yesterday
Is there a computationally optimal point-in-polygon solution (for a dynamic scenario)?
Awarded yesterday
Probability bounds on size of smaller partition in randomized quicksort
Awarded yesterday
Is it possible to use an adjacency matrix for Bellman-Ford algorithm?
Awarded yesterday
Determine the number of reachable states in a subset construction?
Awarded 2 days ago
Bellman Ford facts and specific question
Awarded Jan 16 at 7:30
Is this a correct application of Rice-Shapiro theorem?
Awarded Jan 15 at 15:05
What does it mean that a set of intervals is sorted by the right and left endpoints?
Awarded Jan 15 at 14:20
Proving decidability
Awarded Jan 15 at 13:17
What is the “shortest path heuristic” for the Steiner problem in graphs?
Awarded Jan 15 at 9:35
Proving that a certain language is regular using pumping lemma
Awarded Jan 15 at 8:07
minimum number of edges that should be added to an undirected graph to make it a tree
Awarded Jan 14 at 22:04
What is the simplest algorithm to compress a string?
Awarded Jan 14 at 15:32
Comparison of $(\log^* n)!$ and $(n\log n)^b$ [duplicate]
Awarded Jan 14 at 12:42
Why is the common explanation to the halting problem an oversimplification?
Awarded Jan 14 at 8:57
Why is the Kth Largest Element solution using a MinHeap O(N lgK) in complexity?
Awarded Jan 13 at 22:04
Why we can't create a binomial heap in max-heap format?
Awarded Jan 13 at 17:41
Showing that the language L={⟨M,w⟩ | M moves its head in every step while computing w} is decidable or undecidable
Awarded Jan 13 at 12:28
Proving equivalence of two substitutions by induction
Awarded Jan 13 at 11:26
Unique decipherability of infinite regular language
Awarded Jan 13 at 5:42
How to analyse the worst-case time complexity of this algorithm(a mix of Bubble Sort and Merge Sort)?
Awarded Jan 12 at 18:58
Convert an IF statement in Mixed Integer Programming
Awarded Jan 12 at 17:50
How to prove $T(n) = 2T(n/2) + n/\log(n)$ can't be solved using the Master Theorem?
Awarded Jan 12 at 16:56
Compute average case with best case
Awarded Jan 12 at 15:40
Computable Functions
Awarded Jan 12 at 15:22
Is string spliting formally defined when the string delimiter is an empty string?
Awarded Jan 12 at 14:11
Asymptotic growth of a series
Awarded Jan 12 at 13:18
Lexicographically Smallest String
Awarded Jan 12 at 9:09
Does any language need to have a bottom type?
Awarded Jan 11 at 20:26
If each pixel contains the channels for the 3 primary colours, why can a 1-bit picture only be presented in white and black?
Awarded Jan 10 at 20:17
show that NP is a subset of decidable languages
Awarded Jan 10 at 0:34
Can PDA have empty stack transition?
Awarded Jan 9 at 23:45
Given the Turing machines M1 and M2, is L (M1) = L (M2)? is decidable?
Awarded Jan 9 at 17:26
Question on an Algorithm for Longest Increasing Subsequence
Awarded Jan 9 at 6:42
Is this “superset existence” problem NP-complete?
Awarded Jan 8 at 19:18
Regular Languages and Separating Suffixes
Awarded Jan 8 at 16:56
How to determine the pre and post conditions of a program (Hoare-logic)
Awarded Jan 8 at 15:03
I'm trying to understand why every language has an infinite number of TMs that accept it
Awarded Jan 8 at 14:32
Finding optimal separating value
Awarded Jan 8 at 12:18
What is the actual scope of the Halting Problem impossibility result?
Awarded Jan 7 at 21:37
What is the most efficient algorithm for creating a list of unique values from a list of pairs of value?
Awarded Jan 7 at 18:31
Is there a tool that can check whether m |= p holds, where m and p are both ltl formula
Awarded Jan 7 at 15:26
Difference between UCB1 and UCT
Awarded Jan 7 at 15:10
Computation equivalence of functional and procedural programming
Awarded Jan 7 at 14:45
Finding largest disjoint subtrees spanning nodes
Awarded Jan 7 at 9:35
which neural network is good for predecting the value of strings
Awarded Jan 6 at 17:03
Decidability of Turing machines and misconceptions on the halting problem
Awarded Jan 6 at 10:27
Connection of different buses to memory
Awarded Jan 5 at 23:41
Compute several histograms with multiple filter conditions
Awarded Jan 5 at 11:06
Complex/Hybrid data structures- do people ever combine structures like graphs and hash tables together?
Awarded Jan 5 at 2:51
Min-eigenvalue bound for a random d-regular graph
Awarded Jan 4 at 19:22
Image selection for Object detection
Awarded Jan 4 at 16:25
Combinatorial optimization algorithm with constraints and objective function
Awarded Jan 4 at 15:10
Input distribution in FLP Impossibility
Awarded Jan 4 at 15:10
Finding all subsets of a set of MultiSets made of elements from a single MultiSet (without replacement)
Awarded Jan 4 at 14:01
How to (Efficiently) Sort a List of Items with Parent/Child Relationship
Awarded Jan 3 at 15:50
How to index a tree to allow efficient search for paths?
Awarded Jan 3 at 15:32
Intuition on O(number of leaves) for master theorem
Awarded Jan 3 at 13:57
1
2 3 4 5
…
160