Fundamentals of Computation Theory : 8th International Conference, FCT '91, Gosen, Germany, September 9-13, 1991. Proceedings. 1st ed. 1991

種類:

電子ブック

責任表示:

edited by Lothar Budach

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1991

著者名:

• Budach, Lothar.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 529

ISBN:

9783540383918 [3540383913]    

注記:

On strong separations from AC o -- Number theoretic algorithms and cryptology -- Computations over infinite groups -- Efficiency of Monte Carlo algorithms in numerical analysis -- Approximation algorithms for counting problems in finite fields -- Lower bounds for deterministic and nondeterministic branching programs -- Graph theoretical methods for the design of parallel algorithms -- Lattice basis reduction: Improved practical algorithms and solving subset sum problems -- Information-based complexity: Recent results and open problems -- A survey of some aspects of computational learning theory -- Recent progress in circuit and communication complexity -- The consistency of a noninterleaving and an interleaving model for full TCSP -- A geometrical bound for integer programming with polynomial constraints -- A characterization of binary search networks -- About the effect of the number of successful paths in an infinite tree on the recognizability by a finite automaton with Buchi conditions -- Deterministic de
This volume contains papers which were contributed for presentation at the international conference "Fundamentals of Computation Theory - FCT '91" heldat Gosen, near Berlin, September 9-13, 1991. This was the eighth in the series of FCT conferences organized every odd year. The programme of theconference, including invited lectures and selected contributions, falls into the following categories: - Semantics and logical concepts in the theory of computing, formal specification, - Automata and formal languages, Computational geometry, - Algorithmic aspects of algebra and algebraic geometry, cryptography, - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts), - Algorithms (efficient, probabilistic, parallel, sequential, distributed), - Counting and combinatorics in connection with mathematical computer science. The proceedings of previous FCT meetings are available as Lecture Notes in Computer Science (Vols. 380, 278, 199, 158, 11

ローカル注記:

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