Structure in complexity theory : proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
223 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Structure in complexity theory, proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986, edited by Alan L. Selman, Berlin, Springer-Verlag, 1986, 1 vol. (VI-400 p.), Lecture notes in computer science, 3-540-16486-3 • Structure in Complexity Theory, Texte imprimé, 9783662184103 |
| LEADER | 03800nam a22003737a 4500 | ||
|---|---|---|---|
| 001 | 944916 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155206982 | ||
| 020 | |a 9783540398257 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Structure in complexity theory conference |d (1986 |c :Berkeley, Calif.). | |
| 245 | 1 | 0 | |a Structure in complexity theory : |b proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986 |c edited by Alan L. Selman. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 223 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a The complexity of sparse sets in P -- Isomorphisms and 1-L reductions -- Randomness, relativizations, and polynomial reducibilities -- On non-uniform polynomial space -- One-way functions and circuit complexity -- Relativized alternation -- The polynomial hierarchy and intuitionistic Bounded Arithmetic -- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy -- The boolean hierarchy: Hardware over NP -- Exponential time and bounded arithmetic -- Probabilistic game automata -- Two lower bound arguments with "inaccessible" numbers -- Resource-bounded Kolmogorov complexity of hard languages -- A note on one-way functions and polynomial time isomorphisms -- What is a hard instance of a computational problem? -- The complexity of optimization problems -- The power of the queue -- A depth-size tradeoff for boolean circuits with unbounded fan-in -- An optimal lower bound for turing machines with one work tape and a two-way input tape -- Separation results for bounded alternation -- Parallel computation with threshold functions -- The topology of provability in complexity theory -- Optimal approximations of complete sets -- Expanders, randomness, or time versus space -- Diagonalisation methods in a polynomial setting -- Bounded oracles and complexity classes inside linear space -- Parallel computation and the NC hierarchy relativized -- Probabilistic quantifiers, adversaries, and complexity classes : An overview. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Selman, Alan L. |4 pbd | |
| 776 | 0 | |0 029952131 |t Structure in complexity theory |o proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986 |f edited by Alan L. Selman |c Berlin |n Springer-Verlag |d 1986 |p 1 vol. (VI-400 p.) |s Lecture notes in computer science |z 3-540-16486-3 | |
| 776 | 0 | |t Structure in Complexity Theory |b Texte imprimé |z 9783662184103 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-16486-3 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-F2D4XKBR-M |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747915334 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-16486-3 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750927968 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-16486-3 |z Accès INSA CVL | |
| 997 | |0 944916 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||