Cart
Free Shipping in the UK
Proud to be B-Corp

Advances in Algorithms, Languages, and Complexity Ding-Zhu Du

Advances in Algorithms, Languages, and Complexity By Ding-Zhu Du

Advances in Algorithms, Languages, and Complexity by Ding-Zhu Du


£203.29
Condition - New
Only 2 left

Summary

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.

Advances in Algorithms, Languages, and Complexity Summary

Advances in Algorithms, Languages, and Complexity by Ding-Zhu Du

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.

Table of Contents

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.- Books 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.

Additional information

NPB9780792343967
9780792343967
0792343964
Advances in Algorithms, Languages, and Complexity by Ding-Zhu Du
New
Hardback
Springer
1997-02-28
396
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time

Customer Reviews - Advances in Algorithms, Languages, and Complexity