Library of Math
New and Used Math Books at Great Low Prices
Subscribe to the Library of Math Feed

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

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

enlarge enlarge 
Creators: Ivan M. Havel, Vaclav Koubek
Publisher: Springer
Category: Book

List Price: $74.95
Buy New: $74.20
You Save: $0.75 (1%)



New (9) Used (3) from $74.20


Media: Paperback
Edition: 1
Pages: 521
Number Of Items: 1
Shipping Weight (lbs): 1.6
Dimensions (in): 9.2 x 6.1 x 1.1

ISBN: 354055808X
EAN: 9783540558088

Publication Date: September 10, 1992
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: New American book. Printed on demand and shipped within the US in 4-7 days (expedited) or about 10-14 days (standard). Standard can occasionally be slower so we advise using expedited if quicker delivery is important!

Editorial Reviews:

Product Description
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.

 
about us contact us privacy policy terms of use mision statement lom help
The Library of Math - Online Math Organized by Subject Into Topics. © 2005 - 2008 www.LibraryOfMath.com All rights reserved. math rss