Fundamentals of Computation Theory

Zoltan Esik

ISBN 10: 3540571639 / ISBN 13: 9783540571636

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1993, 1993

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 488 pp. Englisch.

Seller Inventory # 9783540571636

Bibliographic Details

• Title: Fundamentals of Computation Theory
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1993
• Publication Date: 1993
• Language: English
• ISBN 10: 3540571639
• ISBN 13: 9783540571636
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 27D millimeters 235 millimeters width by 155 millimeters height by 27 millimeters depth
• Weight: 733 grams

About this title

Synopsis

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.