Quantum and classical complexity classes : Separations, collapses, and closure properties
- Author
- SPAKOWSKI, Holger1 ; THAKUR, Mayur2 ; TRIPATHI, Rahul3
[1] Institut für Informatik, Heinrich-Heine- Universität Düsseldorf, Düsseldorf 40225, Germany
[2] Department of Computer Science, University of Missouri-Rolla, Rolla, MO 65409, United States
[3] Department of Computer Science, University of Rochester, Rochester, NY 14627, United States - Source
Information and computation (Print). 2005, Vol 200, Num 1, pp 1-34, 34 p ; ref : 55 ref
- CODEN
- INFCEC
- ISSN
- 0890-5401
- Scientific domain
- Computer science
- Publisher
- Elsevier, San Diego, CA
- Publication country
- United States
- Document type
- Article
- Language
- English
- Author keyword
- Computational complexity Gap-definable counting classes Quantum complexity classes Reduction closure properties Relativization theory
- Keyword (fr)
- Borne inférieure Borne supérieure Classe complexité Complexité Comptage Construction Effondrement Fermeture Hypothèse Informatique théorique Oracle Ordinateur Physique Polynôme Système informatique Séparation Temps polynomial 03D55 68Mxx 68XX Hiérarchie polynomiale Monde
- Keyword (en)
- Lower bound Upper bound Complexity class Complexity Counting Construction Collapse Closure Hypothesis Computer theory Oracle Computer Physics Polynomial Computer system Separation Polynomial time World
- Keyword (es)
- Cota inferior Cota superior Clase complejidad Complejidad Contaje Construcción Desmoronamiento Cerradura Hipótesis Informática teórica Computadora Física Polinomio Sistema informático Separación Tiempo polinomial Mundo
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02A Mathematical logic, foundations, set theory / 001A02A01 Logic and foundations / 001A02A01D Recursion theory
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A08 Miscellaneous
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface
- Discipline
- Computer science : theoretical automation and systems Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 16910794
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.ic.2004.10.009 
https://dx.doi.org/10.1016/j.ic.2004.10.009
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:24:\"10.1016\/j.ic.2004.10.009\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"Quantum and classical complexity classes : Separations, collapses, and closure properties\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Information and computation (Print)\";s:9:\"\u0000*\u0000stitle\";s:20:\"Inf. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:3:\"200\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:1:\"1\";s:8:\"\u0000*\u0000epage\";s:2:\"34\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0890-5401\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"SPAKOWSKI\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Holger\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"THAKUR, Mayur\";i:1;s:15:\"TRIPATHI, Rahul\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"INFCEC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"Quantum and classical complexity classes : Separations, collapses, and closure properties\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"34\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:24:\"10.1016\/j.ic.2004.10.009\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"Quantum and classical complexity classes : Separations, collapses, and closure properties\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Information and computation (Print)\";s:9:\"\u0000*\u0000stitle\";s:20:\"Inf. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:3:\"200\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:1:\"1\";s:8:\"\u0000*\u0000epage\";s:2:\"34\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0890-5401\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"SPAKOWSKI\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Holger\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"THAKUR, Mayur\";i:1;s:15:\"TRIPATHI, Rahul\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"INFCEC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"Quantum and classical complexity classes : Separations, collapses, and closure properties\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"34\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:24:\"10.1016\/j.ic.2004.10.009\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:24:\"10.1016\/j.ic.2004.10.009\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"Quantum and classical complexity classes : Separations, collapses, and closure properties\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Information and computation (Print)\";s:9:\"\u0000*\u0000stitle\";s:20:\"Inf. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:3:\"200\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:1:\"1\";s:8:\"\u0000*\u0000epage\";s:2:\"34\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0890-5401\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"SPAKOWSKI\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Holger\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"THAKUR, Mayur\";i:1;s:15:\"TRIPATHI, Rahul\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"INFCEC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"Quantum and classical complexity classes : Separations, collapses, and closure properties\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"34\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:24:\"10.1016\/j.ic.2004.10.009\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"Quantum and classical complexity classes : Separations, collapses, and closure properties\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Information and computation (Print)\";s:9:\"\u0000*\u0000stitle\";s:20:\"Inf. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:3:\"200\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:1:\"1\";s:8:\"\u0000*\u0000epage\";s:2:\"34\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0890-5401\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"SPAKOWSKI\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Holger\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"THAKUR, Mayur\";i:1;s:15:\"TRIPATHI, Rahul\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"INFCEC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"Quantum and classical complexity classes : Separations, collapses, and closure properties\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"34\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:24:\"10.1016\/j.ic.2004.10.009\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"Quantum and classical complexity classes : Separations, collapses, and closure properties\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Information and computation (Print)\";s:9:\"\u0000*\u0000stitle\";s:20:\"Inf. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:3:\"200\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:1:\"1\";s:8:\"\u0000*\u0000epage\";s:2:\"34\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0890-5401\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"SPAKOWSKI\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Holger\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"THAKUR, Mayur\";i:1;s:15:\"TRIPATHI, Rahul\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"INFCEC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"Quantum and classical complexity classes : Separations, collapses, and closure properties\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"34\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
