Mathematical Foundations of Computer Science 1992 (Paperback)

Ivan M. Havel

ISBN 10: 354055808X / ISBN 13: 9783540558088

Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1992

Beschreibung

Paperback. This volume contains 10 invited papers and 40 short communications contributed for presentation at the 17th Symposium on Mathematical Foundations of Computer Science, held in Prague, Czechoslovakia, August 24-28, 1992. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Numerous topics are covered in this volume. The invited papers cover: range searching with semialgebraic sets, graph layout problems, parallel recognition and ranking of context-free languages, expansion of combinatorial polytopes, neural networks and complexity theory, theory of computation over stream algebras, methods in parallel algorithms, the complexity of small descriptions, weak parallel machines, and the complexity of graph connectivity. A collection of conference papers which includes discussion of graph layout problems, parallel recognition and ranking of context-free languages, the expansion of combinatorial polytopes, neural networks and complexity theory, methods in parallel algorithms and graph connectivity. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Bestandsnummer des Verkäufers 9783540558088

Bibliografische Details

• Titel: Mathematical Foundations of Computer Science 1992 (Paperback)
• Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
• Erscheinungsjahr: 1992
• Sprache: Englisch
• ISBN-10: 354055808X
• ISBN-13: 9783540558088
• Einband: Paperback
• Zustand: new

Über diesen Titel

Inhaltsangabe

This volume contains 10 invited papers and 40 short communications contributed for presentation at the 17th Symposium on Mathematical Foundations of Computer Science, held in Prague, Czechoslovakia, August 24-28, 1992. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Numerous topics are covered in this volume. The invited papers cover: range searching with semialgebraic sets, graph layout problems, parallel recognition and ranking of context-free languages, expansion of combinatorial polytopes, neural networks and complexity theory, theory of computation over stream algebras, methods in parallel algorithms, the complexity of small descriptions, weak parallel machines, and the complexity of graph connectivity.