World Library  
Flag as Inappropriate
Email this Article

Dlogtime

Article Id: WHEBN0007404967
Reproduction Date:

Title: Dlogtime  
Author: World Heritage Encyclopedia
Language: English
Subject: AC0, ComplexityClasses, ALL (complexity), R (complexity), PR (complexity)
Collection: Complexity Classes
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Dlogtime

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 cells that can be accessed by the machine. It is a very weak model of time complexity: no random-access Turing machine with a smaller deterministic time bound can access the whole input.[1]

DLOGTIME-uniformity is important in circuit complexity.[1][2]

References

  1. ^ a b Johnson, David S. (1990), "A catalog of complexity classes", Handbook of theoretical computer science, Vol. A, Elsevier, Amsterdam, pp. 67–161,  . See in particular p. 140.
  2. ^ Allender, Eric; Gore, Vivek (1993), "On strong separations from AC0", Advances in computational complexity theory (New Brunswick, NJ, 1990), DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 13, Amer. Math. Soc., Providence, RI, pp. 21–37,  . See in particular p. 23.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.