Cantitate/Preț
Produs

Advances in Algorithms, Languages, and Complexity

Editat de Ding-Zhu Du, Ker-I Ko
en Limba Engleză Paperback – 12 oct 2011
This book contains a collection of survey papers in the areas of algorithms, lan­ guages and complexity, the three areas in which Professor Ronald V. Book has made significant contributions. As a fonner student and a co-author who have been influenced by him directly, we would like to dedicate this book to Professor Ronald V. Book to honor and celebrate his sixtieth birthday. Professor Book initiated his brilliant academic career in 1958, graduating from Grinnell College with a Bachelor of Arts degree. He obtained a Master of Arts in Teaching degree in 1960 and a Master of Arts degree in 1964 both from Wesleyan University, and a Doctor of Philosophy degree from Harvard University in 1969, under the guidance of Professor Sheila A. Greibach. Professor Book's research in discrete mathematics and theoretical com­ puter science is reflected in more than 150 scientific publications. These works have made a strong impact on the development of several areas of theoretical computer science. A more detailed summary of his scientific research appears in this volume separately.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 125260 lei  43-57 zile
  Springer Us – 12 oct 2011 125260 lei  43-57 zile
Hardback (1) 125891 lei  43-57 zile
  Springer Us – 28 feb 1997 125891 lei  43-57 zile

Preț: 125260 lei

Preț vechi: 156575 lei
-20% Nou

Puncte Express: 1879

Preț estimativ în valută:
23972 24901$ 19912£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781461333968
ISBN-10: 1461333962
Pagini: 436
Ilustrații: XXXIV, 396 p.
Dimensiuni: 160 x 240 x 23 mm
Greutate: 0.61 kg
Ediția:1997
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

Theorem Proving in Hierarchical Clausal Specifications.- Algorithms for Learning Finite Automata from Queries: A Unified View.- Coding Complexity: The Computational Complexity of Succinct Descriptions.- Homomorphic Representations of Certain Classes of Languages.- Block-Synchronization Context-Free Grammars.- High Sets for NP.- Average-Case Analysis Using Kolmogorov Complexity.- Genericity and Randomness over Feasible Probability Measures.- Book’s Impact on the Theory of Thue Systems — Abstract.- Sparse Hard Sets for P.- A Survey of Continuous-Time Computation Theory.- Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey.- Relaxed Balancing in Search Trees.- Measure One Results in Computational Complexity Theory.- Average-Case Intractable NP Problems.- Multichannel Lightwave Networks.