Skip to main content
drzbir's user avatar
drzbir's user avatar
drzbir's user avatar
drzbir
  • Member for 10 years
  • Last seen more than 6 years ago
  • Ocean
12 votes
5 answers
1k views

How to find the maximal set of elements $S$ of an array such that every element in $S$ is greater than or equal to the cardinality of $S$?

9 votes
1 answer
458 views

How to partition a set into a given number of disjoint subsets subject to some conditions?

8 votes
1 answer
380 views

How to minimize the cardinality of a set and disjoint partitions subject to constraints in polynomial time?

6 votes
1 answer
183 views

How to select a subset of columns in a given matrix to satisfy a condition?

6 votes
1 answer
115 views

How to partition a set into disjoints subsets each of given size?

5 votes
1 answer
3k views

How to implement the regret matching algorithm?

4 votes
1 answer
601 views

Maximize ratio of sums

4 votes
1 answer
98 views

How to find all maximal sets $S_i$ of a given array $T$ such that every element of $S_i$ is greater than or equal to the cardinality of $S_i$

4 votes
1 answer
359 views

How to partition the rows of a matrix in such a way that every column satisfies a given condition?

4 votes
1 answer
1k views

What is the time complexity in big-O notation of Algorithm X?

3 votes
1 answer
609 views

Why theorem proving is hard?

3 votes
1 answer
239 views

Is it true that independent set is $Ω(n^{1−\epsilon})$-inapproximable unless P=NP?

3 votes
1 answer
5k views

How can we get a Las Vegas algorithm from a Monte Carlo one?

3 votes
1 answer
180 views

How to give an approximation algorithm for this unusual bin packing problem?

2 votes
1 answer
263 views

How to give an upper bound on this bin packing problem?

1 vote
1 answer
45 views

Does a reduction with $\infty$ work?

1 vote
2 answers
129 views

Is it possible to reduce the number of variables in bin packing?

1 vote
0 answers
80 views

Pick algorithm with runtime in O(n) vs. Θ(n) vs. Ω(\log n )

1 vote
1 answer
73 views

How to define an approximation algorithm when it fails?

0 votes
1 answer
884 views

Would a polynomial-time algorithm for an NP-hard problem implies that P=NP? [duplicate]

0 votes
2 answers
4k views

What is the complexity of multiplying a matrix by a scalar?

-1 votes
1 answer
124 views

What is the compleixty of this algorithm?