Skip to main content

Explore our questions

-1 votes
0 answers
58 views

What are some polynomials whose dft can be computed in linear time using essentially fft?

0 votes
0 answers
42 views

Why LOUDS is considered succinct coding?

0 votes
0 answers
70 views

What work on min max connectivity problems has there been?

0 votes
0 answers
65 views

Has multiobjective prize collecting steiner tree or TSP been studied?

7 votes
0 answers
69 views

Tree of addition chains

2 votes
1 answer
403 views

A question on combinatorial algorithm

3 votes
1 answer
117 views

How well can shortest common supersequence over small alphabet size be approximated?

32 votes
5 answers
1k views

Maximal classes for which largest independent set can be found in polynomial time?

7 votes
2 answers
312 views

Proving #P-hardness for the number of subsets of a set of positive integers with a sum of at most T?

0 votes
0 answers
53 views

Shortest sequence that contains a given list of sequences as subsequences

7 votes
0 answers
101 views

Original formulation of Spira's Lemma

10 votes
2 answers
359 views

Algorithm to check whether a given set is Sidon

4 votes
1 answer
217 views

Is Optimal Swap Sorting NP-Hard?

3 votes
2 answers
169 views

Given a weighted graph with $pk$ nodes find a min weight forest with $p$ components each containing exactly $k$ nodes

Browse more Questions