Structure in complexity theory : proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
223 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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 |
Table des matières:
- 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.