Proceedings. Structure in Complexity Theory Fourth Annual Conference, 19-22 June 1989, Eugene, OR, USA (English)
1989
-
ISBN:
- Conference Proceedings / Print
-
Title:Proceedings. Structure in Complexity Theory Fourth Annual Conference, 19-22 June 1989, Eugene, OR, USA
-
Additional title:Proc. Strukturen in der Komplexitaetstheorie, 4. jaehrl. Konf., 19.-22.Juni 1989, Eugene, OR, USA
-
Publisher:
- New search for: IEEE Comput. Soc. Press
-
Place of publication:Washington
-
Publication date:1989
-
Size:271 Seiten
-
ISBN:
-
Type of media:Conference Proceedings
-
Type of material:Print
-
Language:English
-
Keywords:PARALLELALGORITHMUS , KOMPLEXITAETSTHEORIE , ALGORITHMUS , PARALLELVERARBEITUNG , AUTOMATENTHEORIE , ALGEBRA , MENGENLEHRE , MATHEMATISCHER BEWEIS , AUTOMATISIERUNG , RECHNERUNTERSTUETZUNG , FORMALE SPRACHE , GRUPPENTHEORIE , STOCHASTIK , MATHEMATISCHE ABBILDUNG , MATHEMATISCHES MODELL , INFORMATIK , BOOLE-ALGEBRA , TURING-AUTOMAT , BERECHNUNGSKOMPLEXITAET , ISOMORPHIE
-
Source:
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 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