Abstract
In this paper we study bounds on the density of oracles which can help to decrease the time–space complexity of recognition of a particular language by off-line multitape Turing machines. We establish an upper and a lower bound on the density of such oracles which are optimal up to a multiplicative constant and improve the bounds stated by Hromkovicˇ(1991).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have