Proceedings, structure in complexity theory : fourth annual conference (Englisch)
- Neue Suche nach: Structure in Complexity Theory Conference
- Neue Suche nach: IEEE Computer Society
- Neue Suche nach: University of Oregon
- Neue Suche nach: Structure in Complexity Theory Conference
- Neue Suche nach: IEEE Computer Society
- Neue Suche nach: University of Oregon
2011
- Konferenzband / Elektronische Ressource
-
Titel:Proceedings, structure in complexity theory : fourth annual conference
-
Weitere Titelangaben:Structure in complexity theory
Structure in Complexity Theory Conference, 1989, proceedings, Fourth Annual -
Beteiligte:
-
Kongress:Structure in Complexity Theory Conference ; 4th
-
Verlag:
- Neue Suche nach: IEEE Computer Society Press
-
Erscheinungsort:Washington , Los Alamitos, CA
-
Erscheinungsdatum:2011
-
Format / Umfang:1 Online-Ressource (xi, 271 pages)
-
Anmerkungen:illustrations
Includes bibliographical references
Use copy Restrictions unspecified star MiAaHDL -
ISBN:
-
Medientyp:Konferenzband
-
Format:Elektronische Ressource
-
Sprache:Englisch
- Neue Suche nach: 511.3
- Weitere Informationen zu Dewey Decimal Classification
-
Schlagwörter:
-
Klassifikation:
DDC: 511.3 -
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 0_1
-
Proceedings. Structure in Complexity Theory Fourth Annual Conference (Cat. No.89CH2745-8)| 1989
- 3
-
Oracles for structural properties: the isomorphism problem and public-key cryptographyHomer, S. / Selman, A.L. et al. | 1989
- 15
-
On polynomial time Turing and many-one completeness in PSPACEWatanabe, O. / Tang, S. et al. | 1989
- 37
-
Almost everywhere high nonuniform complexityLutz, J.H. et al. | 1989
- 55
-
Boolean functions, invariance groups and parallel complexityClote, P. / Kranakis, E. et al. | 1989
- 77
-
Composition is almost as good as s-1-1Marcoux, Y. et al. | 1989
- 87
-
Finitary substructure languages with application to the theory of NP-completenessRegan, K.W. et al. | 1989
- 97
-
The power of parallel random access machines with augmented instruction setsTrahan, J.L. / Ramachandran, V. / Loui, M.C. et al. | 1989
- 114
-
The complexity of circuit value and network stabilityMayr, E.W. / Subramanian, A. et al. | 1989
- 124
-
Decomposing NC and ACWilson, C.B. et al. | 1989
- 158
-
Multi-oracle interactive protocols with space bounded verifiersFeige, U. / Shamir, A. et al. | 1989
- 165
-
Inductive reasoning and Kolmogorov complexityLi, M. / Vitanyi, P.M.B. et al. | 1989
- 216
-
On the relativized power of additional accepting pathsBeigel, R. et al. | 1989
- 240
-
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machinesKrause, M. / Meinel, C. / Waack, S. et al. | 1989
- 250
-
On the structure of bounded queries to arbitrary NP setsChang, R. et al. | 1989