Cheap and Secure Web Hosting Provider : See Now

[Solved]: Unary in $P$, binary not in $P$

, , No Comments
Problem Detail: 

I would like to know if there is a known decision problem with the following characteristics:

  • Represented in unary, the problem is decidable in polynomial time.
  • Represented in binary, the problem is not decidable in polynomial time (and this fact has been proved, not just conjectured).

For example, Subset-Sum is in $P$ when represented in unary, but it is $NP$-complete in binary. However, this problem does not satisfy my second requirement because we do not know whether $P=NP$.

Asked By : Nic

Answered By : R B

Every single-exponential (i.e. known to be solvable in $O(c^n)$ for some constant $c$) EXPTIME-complete problem will answer your requirements.

For example, see checking thorough rerefinement on finite modal transition systems.

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/27587

3.2K people like this

 Download Related Notes/Documents

0 comments:

Post a Comment

Let us know your responses and feedback