Skip to main content
Share Your Experience: Take the 2024 Developer Survey
dave's user avatar
dave's user avatar
dave's user avatar
dave
  • Member for 7 years, 3 months
  • Last seen more than a month ago
5 votes
Accepted

Tight instance for unweighted maximum coverage problem?

5 votes
Accepted

Is 'double max-$k$ vertex-cover' NP-hard?

4 votes
Accepted

Merge sort worst case running time for lexicographical sorting?

3 votes

Super-strongly connected components?

3 votes
Accepted

Are registers stack, per core or per application based?

3 votes

If 3SAT reduces to its complement then PH=NP

3 votes
Accepted

Given language consisting Turing machines is decidable or not?

2 votes
Accepted

How could I prove that $B$ reduces to $A$ in polynomial time in this case?

2 votes
Accepted

Decidability of checking whether all words accepted by a TM have an even number of 1s

2 votes

Preserving a propositional formula

2 votes
Accepted

Minimum number of nodes in AVL tree

1 vote

Shortest path in a graph where edges are forbidden depending on the path taken

1 vote

Showing that a binary linear code $C$ is self-dual

0 votes
Accepted

Solve Hamilton Circuit with Hamilton Path

0 votes
Accepted

Ask about a non-RE language

0 votes
Accepted

If a problem is complete for NP, is its complement complete for co-NP?