Skip to main content
R B's user avatar
R B's user avatar
R B's user avatar
R B
  • Member for 10 years, 5 months
  • Last seen more than a month ago
1 vote

Complexity of distributively verifying that the diameter is small

2 votes

Showing that interval-sum queries on a binary array can not be done using linear space and constant time

4 votes

Finding the sparsest solution to a system of linear equations

3 votes

New Space Lower-Bound Techniques for Streaming Algorithms

3 votes

Separating lists of words

10 votes
Accepted

Easy decision hard counting Parametrized

2 votes
Accepted

Lower bound for finding repeated elements in sorted array

4 votes
Accepted

Efficient recalculation of the maximum flow when edge capacities are reduced

2 votes
Accepted

Minimum order of partite in a bipartite graph

3 votes

Fastest polynomial time algorithm for solving minimum cost maximum flow problems in bipartite graphs

5 votes
Accepted

Is the following problem in P or in NP?

7 votes
Accepted

Minimum vertex cover on k-regular graphs, for fixed k>2 NP-hard proof?

4 votes

Minimum vertex cover on k-regular graphs, for fixed k>2 NP-hard proof?

12 votes
Accepted

Does $NP$-hardness of $c$-approximation (for some $c>1$) imply $APX$-hardness?

8 votes

Streaming algorithms suitable for undergrad course

6 votes
Accepted

Finding the minimum number of coordinates to change to get a vector inside a subspace

4 votes

Most memorable CS paper titles

1 vote

Statements that imply $\mathbf{P}\neq \mathbf{NP}$

5 votes

Variation on partial Set Cover with penalties

2 votes
Accepted

Hamiltonian cycle on a subset of 2D points, constrained by maximum total length

9 votes
Accepted

Max flow: either saturate an edge or avoids

3 votes

Finding an exactly weighted st-path in a digraph

1 vote

How to map random cardesian points in a 2d array

3 votes
Accepted

Approximating the value of k in $k$-mean clustering problem

3 votes

Is this NP-Hard or does a known optimal polynomial time solution exist?

2 votes

What is the expected depth of a randomly generated tree?

13 votes
Accepted

Examples of problems where exponential algorithms run faster than polynomial algorithms for practical sizes?

7 votes
Accepted

What is the asymptotic time complexity of the number of steps of "Half Or Triple Plus One" ( HOTPO)?

6 votes

Complexity of solving linear equations

10 votes

Examples where the uniqueness of the solution makes it easier to find