Advances in Algorithms, Languages, and Complexity
Editor
- Ding-Zhu Du(University of Minnesota)Ker-I Ko(State University of New York)
Abstract
Individual chapters are listed in the "Chapters" tab
Suggested Citation
DOI: 10.1007/978-1-4613-3394-4
Download full text from publisher
To our knowledge, this item is not available for download. To find whether it is available, there are three options:1. Check below whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a for a similarly titled item that would be available.
Book Chapters
The following chapters of this book are listed in IDEAS- J. Avenhaus & K. Madlener, 1997. "Theorem Proving in Hierarchical Clausal Specifications," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 1-51, Springer.
- José L. Balcázar & Josep Díaz & Ricard Gavaldà & Osamu Watanabe, 1997. "Algorithms for Learning Finite Automata from Queries: A Unified View," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 53-72, Springer.
- José L. Balcázar & Ricard Gavaldà & Osamu Watanabe, 1997. "Coding Complexity: The Computational Complexity of Succinct Descriptions," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 73-91, Springer.
- Franz J. Brandenburg, 1997. "Homomorphic Representations of Certain Classes of Languages," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 93-110, Springer.
- Helmut Jürgensen & Kai Salomaa, 1997. "Block-Synchronization Context-Free Grammars," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 111-137, Springer.
- Johannes Köbler & Uwe Schöning, 1997. "High Sets for NP," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 139-156, Springer.
- Ming Li & Paul Vitányi, 1997. "Average-Case Analysis Using Kolmogorov Complexity," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 157-169, Springer.
- Amy K. Lorentz & Jack H. Lutz, 1997. "Genericity and Randomness over Feasible Probability Measures," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 171-187, Springer.
- Robert McNaughton, 1997. "Book’s Impact on the Theory of Thue Systems — Abstract," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 189-190, Springer.
- Dieter van Melkebeek & Mitsunori Ogihara, 1997. "Sparse Hard Sets for P," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 191-208, Springer.
- Pekka Orponen, 1997. "A Survey of Continuous-Time Computation Theory," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 209-224, Springer.
- F. Otto & Y. Kobayashi, 1997. "Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 225-266, Springer.
- Eljas Soisalon-Soininen & Peter Widmayer, 1997. "Relaxed Balancing in Search Trees," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 267-283, Springer.
- Heribert Vollmer & Klaus W. Wagner, 1997. "Measure One Results in Computational Complexity Theory," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 285-312, Springer.
- Jie Wang, 1997. "Average-Case Intractable NP Problems," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 313-378, Springer.
- Peng-Jun Wan & Feng Cao, 1997. "Multichannel Lightwave Networks," Springer Books, in: Ding-Zhu Du & Ker-I Ko (ed.), Advances in Algorithms, Languages, and Complexity, pages 379-396, Springer.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprbok:978-1-4613-3394-4. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Printed from https://ideas.repec.org/b/spr/sprbok/978-1-4613-3394-4.html