This is an old revision of this page, as edited by RobinK(talk | contribs) at 05:06, 9 January 2010(Rating article for WikiProject Mathematics. Quality: Stub / Priority: Low / Field: discrete (script assisted). Please report any errors on my talk page.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 05:06, 9 January 2010 by RobinK(talk | contribs)(Rating article for WikiProject Mathematics. Quality: Stub / Priority: Low / Field: discrete (script assisted). Please report any errors on my talk page.)
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Can I ask for references where this concept is defined? I tried searching for "exponential hierarchy" on google but found a paper with a different definition [1]. Andris 14:13, May 19, 2004 (UTC)
I was relying on Papadimitriou, "Computational Complexity", page 498. The paper you cite is discussing the strong exponential hierarchy (which generalizes E and NE rather than EXPTIME and NEXPTIME). Gdr 11:23, 2004 May 20 (UTC)
Thanks! I found Papadimitriou's book and it's there. I am still wondering if the exponential hierarchy with quantifiers that he briefly defines on page 497 is the same as the one from page 498 that you quote. I will think about that. Andris 22:13, May 20, 2004 (UTC)
Yes, these two mentions of "exponential hierarchy" are in adjacent paragraphs and are referring to the same thing! Gdr 15:38, 2004 Jul 20 (UTC)
