Question: [27/O35] Let T (n), f(n) be functions both computable in time T (n). Prove that C[f(n), T (n), ] C[f(n), c2f(n) T (n), ],

[27/O35] Let T (n), f(n) be functions both computable in time T (n). Prove that C[f(n), T (n), ∞] ⊂ C[f(n), c2f(n)

T (n), ∞], for some constant

c. Open problem: Can we establish a tighter version of this time hierarchy without an exponential-time gap in the hierarchy?

Comments. Source: [L. Longpr´e, Ph.D. thesis, Cornell University, 1986].

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Elementary Probability For Applications Questions!