Parallel (geometry): Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Steelpillow
Restore to last good version by DVdm, see talk page
en>Wcherowi
m →‎References: Not referenced in article; some ce
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
In [[computational complexity theory]], the '''exponential hierarchy''' is a hierarchy of [[complexity class]]es, which is an [[EXPTIME|exponential time]] analogue of the [[polynomial hierarchy]]. As elsewhere in complexity theory, “exponential” is used in two different meanings (linear exponential bounds <math>2^{cn}</math> for a constant ''c'', and full exponential bounds <math>2^{n^c}</math>), leading to two versions of the exponential hierarchy:<ref>Sarah Mocas, Separating classes in the exponential-time hierarchy from classes in ''PH'', Theoretical Computer Science 158 (1996), no.&nbsp;1–2, pp.&nbsp;221–231.</ref><ref>Anuj Dawar, Georg Gottlob, Lauri Hella, Capturing relativized complexity classes without order, Mathematical Logic Quarterly 44 (1998), no.&nbsp;1, pp.&nbsp;109–122.</ref>


*EH is the union of the classes <math>\Sigma^E_k</math> for all ''k'', where <math>\Sigma^E_k=\mathrm{NE}^{\Sigma^P_{k-1}}</math> (i.e., languages computable in [[nondeterministic Turing machine|nondeterministic]] time <math>2^{cn}</math> for some constant ''c'' with a <math>\Sigma^P_{k-1}</math> [[oracle Turing machine|oracle]]). One also defines <math>\Pi^E_k=\mathrm{coNE}^{\Sigma^P_{k-1}}</math>, <math>\Delta^E_k=\mathrm E^{\Sigma^P_{k-1}}</math>. An equivalent definition is that a language ''L'' is in <math>\Sigma^E_k</math> if and only if it can be written in the form
::<math>x\in L\iff\exists y_1\,\forall y_2\dots Qy_k\,R(x,y_1,\dots,y_k),</math>
:where <math>R(x,y_1,\dots,y_n)</math> is a predicate computable in time <math>2^{c|x|}</math> (which implicitly bounds the length of ''y<sub>i</sub>''). Also equivalently, EH is the class of languages computable on an [[alternating Turing machine]] in time <math>2^{cn}</math> for some ''c'' with constantly many alternations.
*EXPH is the union of the classes <math>\Sigma^{EXP}_k</math>, where <math>\Sigma^{EXP}_k=\mathrm{NEXP}^{\Sigma^P_{k-1}}</math> (languages computable in nondeterministic time <math>2^{n^c}</math> for some constant ''c'' with a <math>\Sigma^P_{k-1}</math> oracle), and again <math>\Pi^{EXP}_k=\mathrm{coNEXP}^{\Sigma^P_{k-1}}</math>, <math>\Delta^{EXP}_k=\mathrm{EXP}^{\Sigma^P_{k-1}}</math>. A language ''L'' is in <math>\Sigma^{EXP}_k</math> if and only if it can be written as
::<math>x\in L\iff\exists y_1\,\forall y_2\dots Qy_k\,R(x,y_1,\dots,y_k),</math>
:where <math>R(x,y_1,\dots,y_k)</math> is computable in time <math>2^{|x|^c}</math> for some ''c'', which again implicitly bounds the length of ''y<sub>i</sub>''. Equivalently, EXPH is the class of languages computable in time <math>2^{n^c}</math> on an alternating Turing machine with constantly many alternations.
We have [[E (complexity)|E]] ⊆ [[NE (complexity)|NE]] ⊆ EH ⊆ [[ESPACE]], [[EXPTIME|EXP]] ⊆ [[NEXPTIME|NEXP]] ⊆ EXPH ⊆ [[EXPSPACE]], and EH ⊆ EXPH.


== References ==
I woke up last week  and realized - Today I have been [http://Browse.deviantart.com/?qh=&section=&global=1&q=solitary solitary] for some time and following much bullying from buddies I today find myself signed up for on line dating. They assured me that there are plenty of sweet, regular and enjoyable folks to fulfill, therefore the pitch is gone by here!<br>I try and maintain as toned as possible being at  [http://lukebryantickets.asiapak.net luke bryan tickets 2014] the gymnasium several times per week. I love my sports and attempt to play or view while many a possible. I will often at Hawthorn fits being wintertime. Note: I have seen the carnage of wrestling suits at stocktake revenue, If you really contemplated buying a sport I don't mind.<br>My family and pals are amazing and spending some time with them at bar gigabytes or dishes is always critical. I haven't ever been into nightclubs as I locate that one may not get a good dialog against the noise. I also have 2 quite cute and undoubtedly cheeky dogs who are almost always eager to meet up fresh folks.<br><br>Look  luke bryan concert tour 2014 ([http://www.ladyhawkshockey.org get more info]) at my webpage - [http://lukebryantickets.omarfoundation.org Meet And Greet Luke Bryan Tickets]
{{reflist}}
 
==External links==
{{CZoo|Class EH|E#eh}}
 
{{ComplexityClasses}}
{{DEFAULTSORT:Exponential Hierarchy}}
[[Category:Complexity classes]]

Latest revision as of 05:24, 21 November 2014


I woke up last week and realized - Today I have been solitary for some time and following much bullying from buddies I today find myself signed up for on line dating. They assured me that there are plenty of sweet, regular and enjoyable folks to fulfill, therefore the pitch is gone by here!
I try and maintain as toned as possible being at luke bryan tickets 2014 the gymnasium several times per week. I love my sports and attempt to play or view while many a possible. I will often at Hawthorn fits being wintertime. Note: I have seen the carnage of wrestling suits at stocktake revenue, If you really contemplated buying a sport I don't mind.
My family and pals are amazing and spending some time with them at bar gigabytes or dishes is always critical. I haven't ever been into nightclubs as I locate that one may not get a good dialog against the noise. I also have 2 quite cute and undoubtedly cheeky dogs who are almost always eager to meet up fresh folks.

Look luke bryan concert tour 2014 (get more info) at my webpage - Meet And Greet Luke Bryan Tickets