heretoinfinity
  • Member for 3 years, 9 months
  • Last seen more than a month ago
  • Newark, NJ, United States
5 answers
12 votes
5k views
5 bookmarks
How does editing software (like Microsoft word or Gmail) pick the 2nd string to compare in Levenshtein distance?
2 answers
8 votes
1k views
1 bookmarks
Isn't linear time O(n)?
1 answers
4 votes
9k views
DFS and BFS Time and Space complexities of 'Number of islands' on Leetcode
1 answers
2 votes
18 views
Comparisons of functions, their big-oh and their implications
3 answers
2 votes
1k views
Algorithm to get any spanning tree not necessarily a minimum spanning tree
1 answers
2 votes
125 views
Where does 1.3606 approximation ratio come from for vertex cover approximation?
1 answers
2 votes
114 views
What are the exponential alternatives that are skipped in dynamic programming for longest increasing subsequence?
1 answers
2 votes
41 views
pictorial representation of pre and post ordering for edge types
1 answers
2 votes
65 views
Code and time complexity of multiplication à la française
2 answers
2 votes
83 views
What do you get when you add $O(n)$ to itself $n$ times?
1 answers
2 votes
63 views
Intuition on O(number of leaves) for master theorem
1 answers
1 votes
332 views
What happens when we increase or decrease capacities in the minimum flow?
1 answers
1 votes
23 views
Are disjoint edges the same as matchings?
1 answers
1 votes
188 views
Reductions versus generalizations
0 answers
1 votes
17 views
How are randomized restarts in local search 4 times likely to give bad local minima?
1 answers
1 votes
29 views
Is the chalk really needed in the "chalk and string labyrinth" analogy for depth-first search?
1 answers
1 votes
45 views
How to calculate the basic steps in Fibonacci sequences to get nFn and n^2
1 answers
0 votes
23 views
How/why is switch made from equation to inequality for certificate of optimality for dual problem in linear programming?
0 answers
0 votes
30 views
Is there such thing as average space complexity? If so, what is it for Timsort?
1 answers
0 votes
27 views
Are problems that are fractions of constraints of NP-complete problems also NP-complete?
1 answers
0 votes
90 views
If P = NP, do these NP-complete problems reduce to these specific easier versions?
1 answers
0 votes
48 views
How are matchings a lower bound for an approximate vertex cover?
1 answers
0 votes
129 views
How does squaring time complexity imply the same time complexity for multiplying different numbers? Isn't it the other way round?
1 answers
0 votes
25 views
Multiplication of polynomials in value representation as done for Fast Fourier Transform
1 answers
0 votes
27 views
Big o notation for sublinear algorithm in streaming algorithm
1 answers
0 votes
56 views
Clarification for binary search in solving optimal TSP when a polynomial algorithm with a budge exists
0 answers
0 votes
80 views
Is reduction from Rudrata/Hamiltonian path to Rudrata/Hamiltonian cycle O(1)?
1 answers
0 votes
133 views
Is O(1) considered polynomial time?
2 answers
0 votes
39 views
Are the frequencies of the Huffman encoding of 3 characters unique?
2 answers
0 votes
126 views
Is Huffman encoding for the entire language or the body of text?