Revision as of 22:32, 19 November 2005 edit Dcoetzee (talk \| contribs) 37,529 edits Add references ← Previous edit		Revision as of 22:38, 19 November 2005 edit undo Dcoetzee (talk \| contribs) 37,529 edits →References: Add Stephen Cook paper Next edit →
Line 65: == References == * [[Stephen Cook]] (1972). [http://portal.acm.org/citation.cfm?id=804913 A hierarchy for nondeterministic time complexity]. ''Proceedings of the fourth annual ACM symposium on Theory of computing'', pp.187–192. * {{Book reference\|Author = [[Michael Sipser]] \| Year = 1997 \| Title = Introduction to the Theory of Computation \| Publisher = PWS Publishing \| ID = ISBN 0-534-94728-X}} Pages 310–313 of section 9.1: Hierarchy theorems. * {{Book reference\|Author = [[Christos Papadimitriou]] \| Year = 1993 \| Title = Computational Complexity \| Publisher = Addison Wesley \| Edition = 1st edition \| ID = ISBN 0201530821}} Section 7.2: The Hierarchy Theorem, pp.143–146.

Time hierarchy theorem: Difference between revisions