Stack Exchange Network

Stack Exchange network consists of 175 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 9976 times
Upper bound on Boolean circuits
Awarded 9 mins ago
Extended Boolean Logic
Awarded 2 hours ago
Why do ¬, ∀ and ∃ have the same precedence?
Awarded 4 hours ago
Can I say θ(g(n)) is the intersection of Ω(g(n)) and O(g(n))?
Awarded 5 hours ago
Global indexing of shared nodes in parallel
Awarded 5 hours ago
Turing Machine remembering copied symbols
Awarded 10 hours ago
Finding topologically sorted connected components in directed acyclic graph
Awarded 18 hours ago
Grouping/Clustering results based on shared values
Awarded 22 hours ago
Are there algorithms with proven upper bounds but no proven lower bound (above constant time)?
Awarded 23 hours ago
How to perform particle swarm optimization clustering of results obtained from tf-idf vectorizer?
Awarded yesterday
Solving a in/equality constraint problem with graph search
Awarded yesterday
Language involving irrational number is not a CFL
Awarded yesterday
Using Union find to check whether there is a cycle in a graph
Awarded yesterday
Using Union find to check whether there is a cycle in a graph
Awarded yesterday
Algorithm to convert a fixed-length string to the smallest possible collision-free representation?
Awarded yesterday
Enumerate over all halting Turing Machines?
Awarded yesterday
Devising a way to spot a contradiction given a set of statements using graphs
Awarded yesterday
Persistent Memory Emulation Platform (PMEP) [on hold]
Awarded 2 days ago
Random Forest - Conditional Permutation Importance
Awarded 2 days ago
proving big theta [duplicate]
Awarded 2 days ago
Problem with definition of bisimilarity
Awarded 2 days ago
Why isn't it necessary to store an integer part of significant in IEEE754 floating point notation?
Awarded 2 days ago
Finding the largest possible area covered by M rectangle under a given histogram
Awarded 2 days ago
Number of ways in which you can traverse N meters by doing jumps of 1,2,3,4 or 5 meter length [on hold]
Awarded 2 days ago
Algorithm/data structure to quickly check if an integer is a member of any [lower, upper] interval
Awarded 2 days ago
(post deleted or otherwise unavailable)
Awarded 2 days ago
Relationship between SPACE(t(n)) and DTIME(t(n))
Awarded 2 days ago
Converting a decimal to IEEE754 32-bit binary number
Awarded 2 days ago
What is a search problem?
Awarded 2 days ago
What is the difference between Consensus and Leader Election problems?
Awarded Mar 18 at 15:20
design a DFA for words a and b with at most 3 letters [on hold]
Awarded Mar 18 at 14:20
An algorithm to maximize the number of parallel tasks
Awarded Mar 18 at 9:25
Image convolution - image darkens
Awarded Mar 17 at 20:40
(post deleted or otherwise unavailable)
Awarded Mar 17 at 20:20
Do I need to consider instance restrictions when showing a language is in P?
Awarded Mar 17 at 16:20
if binary heap potential function is c*size(binary heap)) then insert will not take O(logn)and extract min will not take O(1) amortized time
Awarded Mar 16 at 23:25
Does increasing k in a k-way set-associative cache always lead to a better miss rate?
Awarded Mar 16 at 16:50
Generating intermediate code
Awarded Mar 16 at 16:25
Distance function such that we visit every “color region” once
Awarded Mar 16 at 14:00
Solving recurrence equation $T(n)=T(n^{2/3})+17$
Awarded Mar 16 at 9:45
Name of double sided search algorithms
Awarded Mar 16 at 1:35
Amortized analysis of max-heap
Awarded Mar 15 at 22:45
How to find big-O for an in-place perfect shuffle algorithm
Awarded Mar 15 at 18:35
construct regular expression for a language [duplicate]
Awarded Mar 15 at 9:00
If I can solve Sudoku, can I solve the Travelling Salesman Problem (TSP)? If so, how?
Awarded Mar 15 at 8:25
(post deleted or otherwise unavailable)
Awarded Mar 15 at 7:35
Deriving lower and upper bounds for T(n) = T(n-1) + T(n-2) + 10
Awarded Mar 14 at 17:10
Maximal number of parallel cellular calls with no adjacent cells in a hexagonal setting
Awarded Mar 14 at 16:55
How many different max-heaps exist for a list of n integers?
Awarded Mar 14 at 14:50
Can this system of polynomial equations be solved in polynomial time?
Awarded Mar 14 at 10:10
What is the time complexity of calling successor $n$ times during tree traversal?
Awarded Mar 14 at 3:10
Determine endpoint of a graph given as a list of nodes + direct successors and predecessors
Awarded Mar 13 at 21:25
3SAT instance with EXACTLY 3 instances of each literal
Awarded Mar 13 at 21:05
What is the language L, generated by the grammar G?
Awarded Mar 13 at 19:40
Prove that $I(A;B|C)=0$ given $I(A;B)=0$
Awarded Mar 13 at 19:15
Find the CFG of $\{a^ib^jc^k \mid i,j,k>=0 , \text{if} \quad j=1 \quad \text{then} \quad i=k\}$
Awarded Mar 13 at 4:25
A special case of the SUBSET SUM problem
Awarded Mar 13 at 3:35
Building maze to maximize shortest path, may be given waypoints and teleports
Awarded Mar 13 at 2:20
(post deleted or otherwise unavailable)
Awarded Mar 13 at 1:15
Deadlock and safe state
Awarded Mar 12 at 16:15
1 2 3 4 5 … 167