{"version":"1.0","type":"link","title":"DLOGTIME - Newikis","description":"In computational complexity theory, DLOGTIME is the complexity class of all computational problems solvable in a logarithmic amount of computation time on a deterministic Turing machine. It must be defined on a random-access Turing machine, since otherwise the input tape is longer than the range of…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}