Explore our questions

8 votes
1 answer
332 views

Complexity of removing edges to eliminate a perfect matching

8 votes
1 answer
527 views

Is there a linear-time algorithm for randomly sampling weighted combinations?

0 votes
4 answers
821 views

O(m) time algorithm to check for a strongly connected graph

0 votes
3 answers
269 views

Why the APPROX-VERTEX-COVER algorithm is O(V+E)?

0 votes
1 answer
21 views

Show that $PLANAR \in co-NP \cap NP$

0 votes
0 answers
28 views

Variant of Generalized-Geography problem

0 votes
1 answer
34 views

If $P=NP$, then $LCP \in P$

0 votes
1 answer
22 views

How can I reduce the complexity of an inverse DFT where I have a uniform frequency series being evaluated at non-uniform target points?

0 votes
1 answer
123 views

What is the time complexity of this Java program?

0 votes
1 answer
20 views

How far can we push "counting argument" for proving lower bounds of time complexity?

0 votes
1 answer
26 views

Are there known super-exponential problems?

0 votes
0 answers
20 views

Is super-exponential complexity useful in practice?

-1 votes
0 answers
18 views

P with oracle to P is equal to P

1 vote
1 answer
62 views

Heterogenous Resource Allocation Using Dynamic Programming

Browse more Questions