Fundamentals of computation theory : 8th International Conference, FCT '91 Gosen, Germany, September 9 13, 1991 : proceedings
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 progra...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
529 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Fundamentals of computation theory, 8th International Conference, FCT '91, Gosen, Germany, September 9-13, 1991, proceedings, L. Budach, ed, Berlin, Springer-Verlag, 1991, 1 vol. (XII-426 p.), Lecture notes in computer science, 3-540-54458-5 • Fundamentals of Computation Theory, Texte imprimé, 9783662162064 |
| LEADER | 06317nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 944851 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155204270 | ||
| 020 | |a 9783540383918 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Conference on fundamentals of computation theory |n (08 |d :1991 |c :Gosen). | |
| 245 | 1 | 0 | |a Fundamentals of computation theory : |b 8th International Conference, FCT '91 Gosen, Germany, September 9 13, 1991 : proceedings |c [edited by] L. Budach. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 529 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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 dequeue automata and LL(1) parsing of breadth-depth grammars -- The complexity of computing maximal word functions -- Unambiguity and fewness for logarithmic space -- Differential resultants and subresultants -- Unifying binary-search trees and permutations -- Computational complexity and hardest languages of automata with abstract storages -- Systolic Y-tree automata: closure properties and decision problems -- A new partition lemma for planar graphs and its application to circuit complexity -- Some notes on threshold circuits, and multiplication in depth 4 -- Nonlinear lower bounds on the number of processors of circuits with sublinear separators -- On space-bounded synchronized alternating turing machines -- Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems -- Optimal versus stable in Boolean formulae -- The Gauß lattice basis reduction algorithm succeeds with any norm -- Regularity of one-letter languages acceptable by 2-way finite probabilistic automata -- On the semantics of atomized statements the parallel-choice option -- Automatic proof methods for algebraic specifications -- On the complexity of graph reconstruction -- An optimal adaptive in-place sorting algorithm -- Data structures maxima -- Average-case analysis of equality of binary trees under the BST probability model -- On the subsets of rank two in a free monoid: A fast decision algorithm -- Exact analysis of three tree contraction algorithms -- Degrees of nondeterminism for pushdown automata -- Optimal embedding of a toroidal array in a linear array -- Boolean functions with a large number of subfunctions and small complexity and depth -- Adaptive linear list reorganization for a system processing set queries -- On the decidability of integer subgraph problems on context-free graph languages. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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, 117, 56). | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Budach, Lothar, |d 1935- |4 pbd | |
| 776 | 0 | |0 02219214X |t Fundamentals of computation theory |o 8th International Conference, FCT '91, Gosen, Germany, September 9-13, 1991 |o proceedings |f L. Budach, ed |c Berlin |n Springer-Verlag |d 1991 |p 1 vol. (XII-426 p.) |s Lecture notes in computer science |z 3-540-54458-5 | |
| 776 | 0 | |t Fundamentals of Computation Theory |b Texte imprimé |z 9783662162064 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-54458-5 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-NS5Z73Q9-D |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747915946 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-54458-5 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750928581 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-54458-5 |z Accès INSA CVL | |
| 997 | |0 944851 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||