Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

  7. current community

    your communities

    more stack exchange communities

    company blog
Computer Science

Help Center > Badges > Editor

 Editor
First edit.
Awarded 9657 times
Is this context-free grammar correct for this regular expression?
Awarded 6 hours ago
If there is comparison between two variables then language is not regular. Then how the below two languages L1 and L2 Regular? Please Explain [duplicate]
Awarded 7 hours ago
Cook-Levin theorem and relativization
Awarded 7 hours ago
An efficient algorithm to find a linear transformation between two ternary quadratic forms
Awarded 8 hours ago
Why is it true that given a monotonic heuristic function, A* can be seen as Dijkstra's algorithm where no node needs to be processed more than once?
Awarded 18 hours ago
Number of distinct traingle vertices
Awarded yesterday
Why $\Theta(n^2)$ multiplication of coefficient required for canonical form of polynomial?
Awarded yesterday
Complexity of brute force primality test in the number of digits
Awarded yesterday
The technical definition of a packet in computer network theory
Awarded yesterday
Why theta(n^2) if m=floor(n/2) for Naive String-matching
Awarded 2 days ago
How do i demonstrate my skills at a software engineering interview as a Physicist?
Awarded 2 days ago
Give a grammar for words whose number of $a$'s modulo 2 is larger than whose number of $b$'s modulo 2
Awarded 2 days ago
Complexity of multiplying two integers of size $n$ and $m$
Awarded 2 days ago
(post deleted or otherwise unavailable)
Awarded 2 days ago
Induction to prove equivalence of a recursive and iterative algorithm for Towers of Hanoi
Awarded Jan 18 at 10:45
How to prove a language is not regular using the Pumping Lemma?
Awarded Jan 18 at 1:10
(post deleted or otherwise unavailable)
Awarded Jan 17 at 23:15
Proof of QuickSort algorithm correctness
Awarded Jan 17 at 22:30
Is TSP a more detailed form of the “Set Inclusion” question?
Awarded Jan 17 at 22:15
Split a list of elements into sub lists, each with different criteria
Awarded Jan 17 at 19:45
Is the complexity of this algorithm O($\sqrt{n}$) or linear?
Awarded Jan 17 at 14:45
PRNG for a gaussian distribution?
Awarded Jan 17 at 14:25
Tailrecursive definition for a function
Awarded Jan 17 at 14:10
Ambiguous grammar to equivalent unambiguous grammar
Awarded Jan 17 at 13:00
Optimal dividing of K people into N groups
Awarded Jan 17 at 12:45
(post deleted or otherwise unavailable)
Awarded Jan 17 at 10:20
jump to MMIO address
Awarded Jan 17 at 1:15
Undecidability of the “Single-Halting Problem”
Awarded Jan 16 at 21:50
Solving $T(n) = 3T(n-1) + 2$
Awarded Jan 16 at 20:10
Merging two splay trees whose ranges may overlap in $O(\log N)$
Awarded Jan 16 at 14:15
Understanding Dynamic Frequency Warping (not Dynamic Time Warping)
Awarded Jan 16 at 4:40
Reducing a graph without changing its chromatic number
Awarded Jan 16 at 1:25
Finite State Automata for English regular main verbs
Awarded Jan 15 at 23:15
Instructing operating system - Knowing it's functionalities
Awarded Jan 15 at 15:50
How does the free program identifiers (fpi) extend over constraints and type schemes in $HM(X)$?
Awarded Jan 15 at 15:45
What is the current status of parallel or concurrent programs in the Curry-Howard isomorphism?
Awarded Jan 15 at 13:20
Matrix Representation for logical gates?
Awarded Jan 15 at 4:40
What is the Big-Ω of the following function?
Awarded Jan 15 at 2:05
Equivalence between different Turing Machines and a definition of simulation
Awarded Jan 15 at 0:10
Computer Networks, bandwidth calculation
Awarded Jan 14 at 23:40
How to perform local search to find maximal induced subgraphs?
Awarded Jan 14 at 20:05
Confusion about proof of undecidability of REGULAR TM in Sipser's book
Awarded Jan 14 at 18:10
When is this even possible (even for a dense graphs) $|E| = \Theta (|V|^2)$
Awarded Jan 14 at 15:15
(post deleted or otherwise unavailable)
Awarded Jan 14 at 14:15
Transforming a byte with a subset of a small, fixed set of values and xor into any other value
Awarded Jan 14 at 13:40
Alternatives to directly connected networks for representing frequently-updated graphs
Awarded Jan 14 at 13:00
Proccess scheduling arrival time
Awarded Jan 14 at 12:40
What's the difference between the given parse trees?
Awarded Jan 14 at 8:50
Why is the number of states for DFA is 3n + 1 for this language
Awarded Jan 14 at 2:35
Are all instructions eventually converted to zero-operand instructions?
Awarded Jan 13 at 20:15
What is the ideal complexity of a task with (n-1)!/2^(n-1) possible threes?
Awarded Jan 13 at 13:25
Relaxations for MILP with logical constraints
Awarded Jan 13 at 12:30
Run time analysis of inner loop [duplicate]
Awarded Jan 13 at 12:00
Randomized algorithm for 3SAT
Awarded Jan 13 at 11:35
(post deleted or otherwise unavailable)
Awarded Jan 13 at 10:15
How to measure “sortedness”
Awarded Jan 13 at 8:50
Can I compute closest split pair of points where distance is strictly less than delta
Awarded Jan 12 at 20:55
N subsets with a given sum?
Awarded Jan 12 at 13:05
Why 2 different edge min-cuts in an undirected multigraph must be completely disjoint?
Awarded Jan 12 at 12:35
Which is better ? Iterations or Recursions?
Awarded Jan 12 at 11:25
1 2 3 4 5 … 161