# Answer to Question #43232 in Other Math for Sujata Roy

Question #43232

For any solvable decision problem, there is a way to encode instances of a problem so that the corresponding language can be recognized by a TM with............... time complexity

a) linear

b) exponential

c) polynomial

d) none of these

a) linear

b) exponential

c) polynomial

d) none of these

Expert's answer

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

Assignment Expert12.06.14, 14:30Dear Sujata Roy!You're welcome. We are glad to be helpful. If you really liked our service please press like-button beside answer field. Thank you!

Sujata Roy11.06.14, 17:43Thanks.

## Leave a comment