Computer Science

Scholar

 Scholar
Ask a question and accept an answer.
Awarded 8918 times.
Where is the theory about “binary toggling games”?
Awarded 14 hours ago
Finding the upper bound of states in Minimal Deterministic Finite Automata
Awarded 23 hours ago
Reference asking: phase transition in SAT
Awarded yesterday
Efficient Data Structure for Closest Euclidean Distance
Awarded yesterday
Modified shortest path problem
Awarded yesterday
$\text{DSPACE}(O(1))=\text{REG}$ Proof?
Awarded yesterday
Efficient way to reduce a binomial coefficient as a fraction
Awarded 2 days ago
Asymptotic of divide-and-conquer type recurrence with non-constant weight repartition between subproblems and lower order fudge terms
Awarded 2 days ago
“problematic” non-halting inputs for turing machines
Awarded 2 days ago
Chromatic number of a graph with $10$ vertices each of degree $8$?
Awarded 2 days ago
Regular languages, automata
Awarded 2 days ago
Parallel programming models: Why do OpenMP and MPI dominate?
Awarded 2 days ago
Solving Exact2IS using IS
Awarded 2 days ago
Linear Programming Problem - what is feasible size for solution on a PC
Awarded 2 days ago
NFA-$\epsilon$ extended transition function for inverted strings
Awarded May 31 at 6:51
Lambda calculus without free variables is as strong as lambda calculus?
Awarded May 31 at 4:56
Binary to ASCII using logical operations
Awarded May 31 at 0:41
Regular expression for a palindrome of finite length?
Awarded May 30 at 23:32
Proof for palindrome grammar by induction
Awarded May 30 at 22:57
Is X+Y sorting problem still an open problem?
Awarded May 30 at 21:26
$a^*b^*c^* \setminus \{a^n b^n c^n | n ≥ 0\}$ is not regular using pumping lemma?
Awarded May 30 at 18:34
what is the time complexity of this code
Awarded May 30 at 14:42
On the complexity analysis of quick-union in Algorithms by Sedgewick and Wayne
Awarded May 29 at 20:49
Complexity of recursion T(n) = 2T(n-1) + C?
Awarded May 29 at 9:50
What are the differences between symbolic execution and SAT solvers?
Awarded May 29 at 9:45
How to write a custom editor for a new programming language? [closed]
Awarded May 29 at 7:05
State complexity of converting epsilon-NFAs to NFAs without epsilon transitions
Awarded May 28 at 19:25
Combining 2 problems in NP into one
Awarded May 28 at 16:55
Does the product of two functions equal the product of their Big-O's?
Awarded May 28 at 15:31
Algorithm for ensuring that each element ends up in its specified range when composing a list
Awarded May 28 at 8:10
Minimum spanning tree with small set of possible edge weights
Awarded May 28 at 6:45
Doubt on Performance Comparison of Splay Trees
Awarded May 28 at 6:11
Help comparing relative error for different parenthesizations of addition
Awarded May 27 at 19:18
Master Theorem applicable here?
Awarded May 27 at 18:51
Is reaching in less lines semi-decidable?
Awarded May 27 at 17:34
Decidability of equality, and soundness of expressions involving elementary arithmetic and exponentials
Awarded May 27 at 2:22
Complexity of numerical derivation for general nonlinear functions
Awarded May 27 at 0:56
Decide if a language has a word of a given size
Awarded May 26 at 14:15
Constructing a rectangle of size nx2 with dominos and L-shaped trominos
Awarded May 26 at 9:57
Determine whether removing a node on a graph will disconnect the graph [duplicate]
Awarded May 26 at 2:10
CFG for a given languague
Awarded May 25 at 20:49
(post deleted or otherwise unavailable)
Awarded May 25 at 19:35
What does the phrase “Simple For Loops” mean in computability theory?
Awarded May 25 at 16:55
Managing an hotel using AVL trees - Data Structures
Awarded May 25 at 13:20
Why is it that Ternary search trees are memory efficient?
Awarded May 25 at 7:17
Algorithm for splitting an array into k sub-arrays
Awarded May 25 at 6:28
Languages A, B ∈ NP-complete such that A⋃B = Σ*
Awarded May 24 at 20:16
MST - algorithm to add an edge to the graph
Awarded May 24 at 19:17
Prove that AVL tree has this kind of property with Fibonacci sequence
Awarded May 24 at 15:28
3D intersection algorithm for cylinders
Awarded May 24 at 14:26
Dynamic Program for Tree based question
Awarded May 24 at 13:40
How to prove language $L=\{a^{i}b^{j} : i \leq j^{2}\}$ is not CFL using Pumping lemma?
Awarded May 24 at 6:32
Number of minimum cuts in a graph
Awarded May 23 at 20:12
Do you ever “download” a language?
Awarded May 23 at 14:50
Turing machine that can move right only $O(1)$ steps beyond input
Awarded May 23 at 14:04
What is the fastest algorithm to solve $k$-path problem?
Awarded May 23 at 11:08
Logarithmic space verifier with unbounded witness
Awarded May 23 at 8:31
Unification Algorithm without Occur Check
Awarded May 23 at 3:56
Turing machine with a finite tape after the input word ends
Awarded May 22 at 15:42
Why ASCII letter A has a Hamming Distance of 3?
Awarded May 22 at 13:26
1
2 3 4 5
…
149