File:Important Complexity Classes within PSPACE.svg
From Wikimedia Commons, the free media repository
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 556 × 556 pixels. Other resolutions: 240 × 240 pixels | 480 × 480 pixels | 768 × 768 pixels | 1,024 × 1,024 pixels | 2,048 × 2,048 pixels.
Original file (SVG file, nominally 556 × 556 pixels, file size: 2 KB)
File information
Structured data
Captions
Summary
[edit]DescriptionImportant Complexity Classes within PSPACE.svg |
English: Important complexity classes within PSPACE, i.e., P, NP and coNP |
Source | Own work |
Author | Siyuwj |
Licensing
[edit]I, the copyright holder of this work, hereby publish it under the following licenses:
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue |
You may select the license of your choice.
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 05:39, 8 April 2010 | 556 × 556 (2 KB) | Siyuwj (talk | contribs) | {{Information |Description={{en|1=Important complexity classes within PSPACE, i.e., P, NP and coNP}} |Source={{own}} |Author=Siyuwj |Date= |Permission= |other_versions= }} Category:Computational complexity |
You cannot overwrite this file.
File usage on Commons
There are no pages that use this file.
File usage on other wikis
The following other wikis use this file:
- Usage on zh.wikipedia.org
- 非确定型图灵机
- 計算複雜性理論
- 空间复杂度
- P/NP问题
- NP完全
- P (複雜度)
- Template:复杂度类
- 複雜度類
- 反NP
- 歸約
- 決定性問題
- NP (複雜度)
- 布尔可满足性问题
- User talk:Cw.ahbong
- 交互式证明系统
- BPP (複雜度)
- NTIME
- RP (複雜度)
- 機率圖靈機
- #P
- 交替式图灵机
- PSPACE
- UP (複雜度)
- P-完全
- ZPP (複雜度)
- 複雜度類列表
- BPL (複雜度)
- NP-易
- 2-EXPTIME
- RE (複雜度)
- ALL (複雜度)
- PR (複雜度)
- R (複雜度)
- EXPTIME
- 指數譜系
- DLOGTIME
- PolyL
- NSPACE
- DTIME
- EXPSPACE
- NEXPTIME
- SC (複雜度)
- PH (複雜度)
- PP (複雜度)
- L (複雜度)
- ELEMENTARY
- NP困难
- User:Bluedecklibrary/P (複雜度)
- User:Bluedecklibrary/Template:复杂度类
- 量子复杂性理论
View more global usage of this file.