Skip to main content

Explore our questions

5 votes
2 answers
716 views

Is it possible that $L=NP$?

-1 votes
1 answer
29 views

is my attempt correct? proof that L in P or in NPC? $L=\{G$ is an undirected graph on n vertices VC $U$ and an IS $I$ such that $|U|+|I|=n+10$ \}

1 vote
2 answers
33 views

What is the Computational Complexity of this Difference of Squares problem?

0 votes
0 answers
16 views

Largest Tetrahedra from a set of points

1 vote
1 answer
13 views

Special case of 2-dim subset sum problem with only 0 and 1s

1 vote
1 answer
35 views

Deciding if a regular language is empty can be done in polytime but deciding if it does not accept {0,1}* is not?

0 votes
0 answers
22 views

DTIME(t(n) logt(n)) relation to DTIME(t(n)) / sublin

0 votes
2 answers
578 views

Why is EXPTIME in EXPSPACE?

30 votes
5 answers
61k views

How can I reduce Subset Sum to Partition?

0 votes
1 answer
14 views

NP-hardness of optimization with promise

31 votes
1 answer
11k views

Does space complexity analysis usually include output space?

0 votes
0 answers
11 views

Disjunctively Self-Reducible Languages and Their Relationship to NP

3 votes
2 answers
2k views

Negative simple path NP-Complete

0 votes
1 answer
100 views

Possible reduction from SUBSET-SUM

Browse more Questions