Editing Space hierarchy theorem (section)

== References ==
{{reflist}}
*{{cite book | zbl=1193.68112 | last1=Arora | first1=Sanjeev | author-link1=Sanjeev Arora | last2=Barak | first2=Boaz | title=Computational complexity. A modern approach | publisher=[[Cambridge University Press]] | year=2009 | isbn=978-0-521-42426-4 }}
* [[Luca Trevisan]]. [http://www.cs.berkeley.edu/~luca/cs172-04/noteh.pdf Notes on Hierarchy Theorems]. Handout 7. CS172: Automata, Computability and Complexity. U.C. Berkeley. April 26, 2004.
* [[Viliam Geffert]]. [http://portal.acm.org/citation.cfm?id=763728 Space hierarchy theorem revised]. ''Theoretical Computer Science'', volume 295, number 1–3, p.&nbsp;171-187. February 24, 2003.
* {{cite book | first = Michael | last = Sipser | author-link = Michael Sipser | year = 1997 | title = Introduction to the Theory of Computation | publisher = PWS Publishing | isbn = 0-534-94728-X | url-access = registration | url = https://archive.org/details/introductiontoth00sips }} Pages 306&ndash;310 of section 9.1: Hierarchy theorems.
* {{cite book | first=Christos | last=Papadimitriou | author-link = Christos Papadimitriou | year = 1993 | title = Computational Complexity | publisher = Addison Wesley | edition = 1st  | isbn = 0-201-53082-1}} Section 7.2: The Hierarchy Theorem, pp.&nbsp;143&ndash;146.

<!-- Need to add original source here -->

[[Category:Articles containing proofs]]
[[Category:Structural complexity theory]]
[[Category:Theorems in computational complexity theory]]