Computer Science

Scholar

 Scholar
Ask a question and accept an answer.
Awarded 11437 times.
T(n) = T(n-1) + T(n-1) vs T(n) = 2*T(n-1)
Awarded 10 hours ago
Is $L=\{1^n2^n3^m : n\neq m\}$ context free?
Awarded yesterday
Is a predecessor subgraph always connected?
Awarded 2 days ago
Why is `3[arr]` notation of accessing elements in array is not used?
Awarded 2 days ago
Does this really define a 0L-system?
Awarded Sep 21 at 21:30
State Machines as Functors
Awarded Sep 21 at 20:01
How to prove L := { a^n b^n c^m | n,m >= 0 & n != m } is not context-free?
Awarded Sep 20 at 8:07
Does 'reverse' mean 2 separate things in contexts of tree vs. graph traversal?
Awarded Sep 18 at 15:04
Time complexity of GPU computing
Awarded Sep 17 at 23:49
Function of data pin(s) in a single RAM chip
Awarded Sep 16 at 20:26
warning: ISO C++ forbids converting a string constant to ‘char*’ [closed]
Awarded Sep 16 at 13:09
Are integer linear *feasibility* problems NP-hard?
Awarded Sep 16 at 1:36
Can a branch be pipelined with certainty if the branch condition can be known significantly before the actual branch?
Awarded Sep 15 at 17:02
Time complexity of function
Awarded Sep 14 at 11:26
Are Haskell monads stronger than strong monads?
Awarded Sep 13 at 0:46
Why does the negative reward function in LQR encourage convergence to the origin?
Awarded Sep 12 at 21:34
Validity of time complexity analysis
Awarded Sep 11 at 9:32
Algorithm for iteratively distributing $5$ units to two variables
Awarded Sep 10 at 14:47
Number of non-zero elements in intersection of two bloom filters
Awarded Sep 8 at 9:56
Discrepancy in Time-Complexity of Bounded Halting Problem
Awarded Sep 7 at 13:16
Understanding crossover points in efficiency between insertion and merge sorts
Awarded Sep 5 at 21:16
Knapsack with fixed size
Awarded Sep 5 at 5:28
Minimum edges removed to turn a strongly connected graph into an acyclic graph
Awarded Sep 2 at 18:47
Are 2 independent PDAs equivalent to a turing machine?
Awarded Sep 1 at 7:02
Combining chunks on an infinite grid into regions
Awarded Aug 31 at 20:36
Dominating sets and treewidth
Awarded Aug 30 at 15:10
How to prove that the subset of a language L that is in P is also in P?
Awarded Aug 24 at 16:35
Schoolclass Optimization Algorithm for finding Stable Matching
Awarded Aug 22 at 19:27
Can we ever achieve Turing completeness?
Awarded Aug 22 at 12:42
A Fast Linear-Arithmetic Solver: How can Gaussian elimination be used to simplify matrix A?
Awarded Aug 21 at 21:10
What's the standard technique to test if the algorithm satisfies mutual exclusion, progress and bounded waiting or not?
Awarded Aug 21 at 15:26
Sign confusion in a BFS lemma
Awarded Aug 20 at 0:08
What are the conditions necessary for a programming language to have no undefined behavior?
Awarded Aug 18 at 20:33
What can i say about L1 given that L2, L1L2 and L2L1 are regular?
Awarded Aug 18 at 18:43
Any hints about loop invariant of weird loop?
Awarded Aug 18 at 14:17
How is a video file read frame by frame without loading the entire video file in memory?
Awarded Aug 17 at 6:27
Is $n^{1.03} = \Omega(n \log \log n)$?
Awarded Aug 16 at 17:16
n (mod k) circuit
Awarded Aug 16 at 2:41
How are blind writes recoverable in a transaction schedule?
Awarded Aug 15 at 17:00
Given a language L how can I derive its Boolean formula?
Awarded Aug 14 at 20:20
Could there be a computer or components based on a non-classical logic?
Awarded Aug 14 at 12:11
What are quines (layman friendly)?
Awarded Aug 12 at 6:31
Heap's Algorithm for k-permutations?
Awarded Aug 11 at 17:25
Is it possible to avoid encoding the state in streaming ANS?
Awarded Aug 9 at 15:48
How to create a DFA with memory
Awarded Aug 9 at 14:41
Splay Trees - Sequential Access Theorem & lower bound for comparison-based sorting
Awarded Aug 8 at 17:40
If I want to prove that a problem is in NP, can the vertifier use exponential space?
Awarded Aug 6 at 11:50
Is this sorting problem NP-complete?
Awarded Aug 6 at 1:41
How to identify Dominant terms in big-O notation and understand Time Complexity of an algorithm?
Awarded Aug 4 at 17:08
Can a linear programming method be used to solve systems of inequalities with OR (disparate) compound inequalities?
Awarded Aug 3 at 14:08
What reason could a system have to limit the length of a password to 8 chars?
Awarded Jul 30 at 8:46
What is the technical name for one sided tree traversal and which algorithms are good for it?
Awarded Jul 29 at 12:56
Understanding Language L
Awarded Jul 27 at 19:16
Subtracting Two same asymptotic values
Awarded Jul 27 at 12:37
Collinear convex hull
Awarded Jul 23 at 22:30
Looking for efficient algorithm to pick out a unique equivalence class representative for 2D arrays with lots of symmetries
Awarded Jul 21 at 23:57
Solving shortest path with negative weights with linear program. What is the underlying problem we want to solve?
Awarded Jul 21 at 5:47
Minimum Number of Unique Identifiers for a Grid of Cells
Awarded Jul 20 at 18:41
How to start with verifying a formal proof programmatically?
Awarded Jul 20 at 14:42
Ways to speed up a Recursive Backtracking Algorithm
Awarded Jul 19 at 12:40
1
2 3 4 5
…
191

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.