Advances in Algorithms, Languages, and Complexity
Springer-Verlag New York Inc.
978-1-4613-3396-8 (ISBN)
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.
Zusatzinfo | XXXIV, 396 p. |
---|---|
Verlagsort | New York, NY |
Sprache | englisch |
Maße | 160 x 240 mm |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik ► Algebra | |
Mathematik / Informatik ► Mathematik ► Analysis | |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
ISBN-10 | 1-4613-3396-2 / 1461333962 |
ISBN-13 | 978-1-4613-3396-8 / 9781461333968 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich