Skip to main content
AspiringMat's user avatar
AspiringMat's user avatar
AspiringMat's user avatar
AspiringMat
  • Member for 9 years, 2 months
  • Last seen this week
2 votes
1 answer
5k views

Difference between fixed-to-variable length codes and variable-to-fixed length codes?

3 votes
2 answers
3k views

Why can we drop the superscripts in the Floyd Warshall algorithm?

5 votes
1 answer
2k views

Maximum interval scheduling - Circular Variation

3 votes
1 answer
1k views

Can Strassen's multiplication algorithm be improved if we divide matrices to 3x3 or axa in general?

1 vote
2 answers
983 views

What algorithm paradigm is a recursive solver of Sudoku?

9 votes
1 answer
416 views

How to maximize $(h[j]-h[i])(j-i)$ in $O(n)$

2 votes
2 answers
353 views

Complexity of Block edit distance with Swapping only

2 votes
2 answers
339 views

Question about "with high probability"

1 vote
2 answers
215 views

Complexity of minimizing the maximum inter-cluster distance?

1 vote
0 answers
158 views

Minimum Degree Spanning Tree Without Restricting Vertices Searched [closed]

3 votes
2 answers
155 views

Hamiltonian cycle in $C_n^k$ in polynomial time for constant $k$?

0 votes
1 answer
138 views

In Amortized Analysis, can we chose how big $n$ is?

0 votes
0 answers
109 views

Minimum weight $k-$path cover on a DAG proof verification

0 votes
1 answer
92 views

What is the best Approximation algorithm to schedule a task graph?

3 votes
0 answers
90 views

Approximation algorithm for minimising $x_i+y_i$ for monotonically increasing sequence $x_i$ and monotonically decreasing sequence $y_i$ [closed]

1 vote
0 answers
87 views

Are there Dynamic programming speedups for $dp[i]=\min_{j<i}\{ f(a_j, a_i)\}$

1 vote
0 answers
86 views

Must every NP-Complete Problem have a class of instances which is solvable in Poly time? [closed]

2 votes
0 answers
69 views

Fast algorithm to check if a query line segment contains a point that is not covered by $n$ disks in $\mathbb{R}^2$

1 vote
1 answer
68 views

Does $\mathcal{P}\neq \mathcal{NP}$ preclude the possibility that an NPC problem could have polynomial time algorithms on *almost* any input?