Fundamentals of Computation Theory : 9th International Conference, FCT '93, Szeged, Hungary, August 23-27, 1993. Proceedings

Zoltan Esik

ISBN 10: 3540571639 / ISBN 13: 9783540571636

Verlag: Springer Berlin Heidelberg, 1993

Beschreibung

Druck auf Anfrage Neuware - Printed after ordering - This volume contains the proceedings of the Ninth Conferenceon Fundamentalsof Computation Theory (FCT 93) held inSzeged, Hungary, in August 1993. The conference was devotedto a broad range of topics including:- Semanticsand logical concepts in the theory of computingand formal specification- Automata and formal languages- Computational geometry, algorithmic aspects of algebra andalgebraic 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 mathematicalcomputer scienceThe volume contains the texts of 8 invitedlectures and 32short communications selected by the international programcommittee from a large number of submitted papers.

Bestandsnummer des Verkäufers 9783540571636

Bibliografische Details

• Titel: Fundamentals of Computation Theory : 9th International Conference, FCT '93, Szeged, Hungary, August 23-27, 1993. Proceedings
• Verlag: Springer Berlin Heidelberg
• Veröffentlichungsdatum: 1993
• Sprache: Englisch
• ISBN-10: 3540571639
• ISBN-13: 9783540571636
• Bindung: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

This volume contains the proceedings of the Ninth Conference on Fundamentalsof Computation Theory (FCT 93) held in Szeged, Hungary, in August 1993. The conference was devoted to a broad range of topics including: - Semanticsand logical concepts in the theory of computing and 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 volume contains the texts of 8 invitedlectures and 32 short communications selected by the international program committee from a large number of submitted papers.