查看“︁Template:Infobox Complexity Class”︁的源代码

{{infobox
| title = {{{class|{{PAGENAMEBASE}}}}}
| image = {{{image|}}}

| labelstyle = white-space:nowrap;

| label1 = 定义于
| data1 = {{{wheredefined|}}}

| label2 = 完全集
| data2 = {{{complete-class|}}}

| label3 = [[补 (复杂度)|补类]]
| data3 = {{{complement-class|}}}

| label4 = 等价类
| data4 = {{{equals|}}}

| label5 = [[DTIME]]
| data5 = {{{dtime|}}}

| label6 = 相关
| data6 = {{{related|}}}

| label7 = 真包含于
| data7 = {{{proper-supersets|}}}

| label8 = 包含于
| data8 = {{{improper-supersets|}}}

| label9 = 不等
| data9 = {{{notequals|}}}

| label10 = 子集
| data10 = {{{improper-subsets|}}}

| label11 = 真子集
| data11 = {{{proper-subsets|}}}

| label12 = 标准问题
| data12 = {{{canonical-problems|}}}

| label13 = 性质
| data13 = {{{properties|}}}

| label14 = 被…[[低陷 (复杂度)|低陷]]
| data14 = {{{low-with|}}}

| label15 = 对…[[低陷 (复杂度)|低陷]]
| data15 = {{{low-for|}}}

| label16 = 封闭归约
| data16 = {{{closed-reductions|}}}

| label17 = [[计算模型]]
| data17 = {{{models|}}}

| label18 = 外部链接
| data18 = {{{external-urls|}}}}}<noinclude><pre>
{{Infobox Complexity Class
|class=
|image=
|long-name=
|description=
|external-urls=
|wheredefined=
|dtime=
|complete-class=
|complement-class=
|proper-supersets=
|improper-supersets=
|equals=
|related=
|notequals=
|improper-subsets=
|proper-subsets=
|properties=
|low-with=
|low-for=
|closed-reductions=
|closed-operations=
|canonical-problems=
|models=
}}
</pre>

{{Infobox Complexity Class
|class=[[PSPACE]] (例子)
|image=[[File:Complexity_subsets_pspace.svg|200px]]
|long-name=多项式空间
|description=
|wheredefined=
|external-urls=[http://qwiki.stanford.edu/wiki/Complexity_Zoo:P#pspace Complexity Zoo]
|dtime=<math>n^{\Omega(1)}</math>, <math>2^{n^{O(1)}}</math>
|complete-class=[[PSPACE完全]]
|complement-class=自身
|proper-supersets=[[EXPSPACE]]<ref name="spacehierarchy">[[空间层次定理]]</ref>
|improper-supersets=[[AlmostPSPACE]]<ref>Definition of Almost-PSPACE. PSPACE ⊆ PSPACE^A for every A.</ref>, [[EXPTIME]], [[RG (复杂度)|RG]], [[QPSPACE]]<ref name="zoodiagram">Greg Kuperberg, Complexity Zoology: Active Inclusion Diagram, 2006, http://www.math.ucdavis.edu/~greg/zoology/diagram.xml</ref>
|equals=[[AP (复杂度)|AP]]<ref>[http://portal.acm.org/citation.cfm?id=322243&coll=Portal&dl=ACM&CFID=60283170&CFTOKEN=44928981 Chandra, A.K. and Kozen, D.C. and Stockmeyer, L.J., 'Alternation'], Journal of the ACM, Volume 28, Issue 1, pp. 114-133, 1981.</ref>, [[BPPSPACE]]<ref>Complexity Zoo, [http://qwiki.stanford.edu/wiki/Complexity_Zoo:A#almostpspace], accessed Mars 25, 2009</ref>, [[IP (复杂度)|IP]]<ref>Adi Shamir. [http://portal.acm.org/citation.cfm?doid=146585.146609 IP = PSPACE]. ''Journal of the ACM'', volume 39, issue 4, p.869&ndash;877. October 1992.</ref>, [[PSPACE|NPSPACE]]<ref>[[Savitch's theorem]]</ref>, [[PPSPACE]]<ref name="papadimitriou85games">{{cite journal|author=[[Christos Papadimitriou]]|title="Games against Nature" | journal="Journal of Computer and System Sciences"|volume=31|year=1985}}</ref>, [[SAPTIME]]<ref name="papadimitriou85games"/>
|related=[[PTIME]]
|notequals=[[PTIME|P]]-close, [[PTIME|P]]/log
|improper-subsets=[[CH (复杂度)|CH]]<ref name="wagner85complexity">{{cite journal|author=K. W. Wagner|title=The complexity of combinatorial problems with succinct representation|journal=Informatica|volume=23|year=1986|pages=325-356}}</ref>, P^[[PP (复杂度)|PP]]<ref name="toda89onthe">{{cite journal|author=S. Toda|title=On the computational power of PP and ⊕P|journal=FOCS 1989|year=1989|pages=514-519}}</ref>, P^[[Sharp-P|#P]]<ref name="toda89onthe"/>, [[QSZK]], [[RG (复杂度)|RG]][1]
|proper-subsets=[[NL (复杂度)|NL]]<ref name="spacehierarchy"/>
|properties=Syntactic
|low-with=自身
|low-for=自身
|closed-reductions=[[多项式时间图灵规约|多项式时间]]
|closed-operations=
|canonical-problems=[[QSAT]]
|models=[[交替式图灵机]], [[图灵机]]
}}
== 例子所用参考资料 ==
{{reflist}}
[[Category:數學模板]]
</noinclude>