Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Fundamentals of Computation Theory: International Conference FCT ' 89, Szeged, Hungary, August 21-25, 1989. Proceedings > Constructivity, computability, and computational complexity in analysis
Fundamentals of Computation Theory: International Conference FCT ' 89, Szeged, Hungary, August 21-25, 1989. Proceedings |
Janos Csirik; Ferenc Gecseg; Janos Demetrovics
Springer Berlin Heidelberg
Fundamentals of Computation Theory: International Conference FCT ' 89, Szeged, Hungary, August 21-25, 1989. Proceedings
Constructivity, computability, and computational complexity in analysis
Authors

Klaus Weihrauch

ARI Id

1664637330923_2521745

Access

Not Available Free

Pages

480-493

DOI

10.1007/3-540-51498-8_47

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-51498-8_47

Table of Contents of Book
Showing 1 to 20 of 48 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
On word equations and Makanin's algorithm
Habib Abdulrab; Jean-Pierre Pécuchet
1-12
Complexity classes with complete problems between P and NP-C
Carme Àlvarez; Josep Díaz; Jacobo Torán
13-24
Interpretations of synchronous flowchart schemes
Miklós Bartha
25-34
Generalized Boolean hierarchies and Boolean hierarchies over RP
Alberto Bertoni; Danilo Bruschi; Deborah Joseph; Meera Sitharam; Paul Young
35-46
The equational logic of iterative processes
Stephen L. Bloom
47-57
The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
Hans L. Bodlaender; Shlomo Moran; Manfred K. Warmuth
58-67
The jump number problem for biconvex graphs and rectangle covers of rectangular regions
Andreas Brandstädt
68-77
Recent developments in the design of asynchronous circuits
J. A. Brzozowski; J. C. Ebergen
78-94
New simulations between CRCW PRAMs
Bogdan S. Chlebus; Krzysztof Diks; Torben Hagerup; Tomasz Radzik
95-104
About connections between syntactical and computational complexity
Jean-Luc Coquidé; Max Dauchet; Sophie Tison
105-115
Completeness in approximation classes
Pierluigi Crescenzi; Alessandro Panconesi
116-126
Separating completely complexity classes related to polynomial size Ω-Decision trees
Carsten Damm; Christoph Meinel
127-136
On product hierarchies of automata
P. Dömösi; Z. Ésik; B. Imreh
137-144
On the communication complexity of planarity
P. Ďuriš; P. Pudlák
145-147
Context-free NCE graph grammars
Joost Engelfriet
148-161
Dynamic data structures with finite population: A combinatorial analysis
J. Françon; B. Randrianarimanana; R. Schott
162-174
Iterated deterministic top-down look-ahead
Z. Fülöp; S. Vágvölgyi
175-184
Using generating functions to compute concurrency
Dominique Geniet; Loÿs Thimonier
185-196
A logic for nondeterministic functional programs extended abstract
Ana Gil-Luezas
197-208
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 48 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings