Mathematical Foundations of Computer Science 1992 : 17th International Symposium, Prague, Czechoslovakia, August 24-28, 1992. Proceedings

Ivan M. Havel

ISBN 10: 354055808X / ISBN 13: 9783540558088

Published by Springer, Springer, 1992

About this Item

Druck auf Anfrage Neuware - Printed after ordering - This volume contains 10 invited papers and 40 shortcommunications contributed for presentation at the 17thSymposium on Mathematical Foundations of Computer Scienceheld in Prague, Czechoslovakia, August 24-28, 1992.The series of MFCS symposia, organized alternately in Polandand Czechoslovakia since 1972, has a long and wellestablished tradition. The purpose of the series is toencourage high-quality research in all branches oftheoretical computer science and to bring togetherspecialists working actively in the area.Numerous topics are covered in this volume. The invitedpapers cover: range searching with semialgebraic sets, graphlayout problems, parallel recognition and ranking ofcontext-free languages, expansion of combinatorialpolytopes, neural networks and complexity theory, theory ofcomputation over stream algebras, methods in parallelalgorithms, the complexity of small descriptions, weakparallel machines, and the complexity of graph connectivity.

Seller Inventory # 9783540558088

Bibliographic Details

• Title: Mathematical Foundations of Computer Science 1992 : 17th International Symposium, Prague, Czechoslovakia, August 24-28, 1992. Proceedings
• Publisher: Springer, Springer
• Publication Date: 1992
• Language: English
• ISBN 10: 354055808X
• ISBN 13: 9783540558088
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 29D millimeters 235 millimeters width by 155 millimeters height by 29 millimeters depth
• Weight: 803 grams

About this title

Synopsis

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.