STACS 87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19-21, 1987. 1st ed. 1987

種類:

電子ブック

責任表示:

edited by Franz J. Brandenburg, Guy Vidal-Naquet, Martin Wirsing

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1987

著者名:

• Brandenburg, Franz J.
• Vidal-Naquet, Guy.
• Wirsing, Martin.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 247

ISBN:

9783540474197 [3540474196]    

注記:

Towards a theory of relativizations: Positive relativizations -- Natural semantics -- On local routing of two-terminal nets -- Geometric relations among Voronoi diagrams -- Finding the largest empty rectangle on a grated surface -- Efficient graph algorithms using limited communication on a fixed-size array of processors -- On selecting the largest element in spite of erroneous information -- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems -- Graph isomorphism is in the low hierarchy -- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees -- Self-reducibility -- Probability one separation of the Boolean hierarchy -- Reversal complexity of multicounter and multihead machines -- Computing the counting function of context-free languages -- On the k-freeness of morphisms on free monoids -- Avoidable patterns on 2 letters -- Polynomial operations on rational languages -- Some structural aspects of hyper

ローカル注記:

学内専用E-BOOKS (local access only)