Lecture Notes in Computer Science
© 2001
Computing and Combinatorics
7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings
Editors: Wang, Jie (Ed.)
Free PreviewBuy this book
- Table of contents (66 chapters)
-
-
Complete Problems for Valiant’s Class of qp-Computable Families of Polynomials
Pages 1-10
-
Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n 4.03)
Pages 11-20
-
On Universally Polynomial Context-Free Languages
Pages 21-27
-
Separating Oblivious and Non-oblivious BPs
Pages 28-38
-
Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws
Pages 39-48
-
Table of contents (66 chapters)
Read this book on SpringerLink
- Download Sample pages 1 PDF (30.4 KB)
- Download Table of contents PDF (53.9 KB)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Computing and Combinatorics
- Book Subtitle
- 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings
- Editors
-
- Jie Wang
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 2108
- Copyright
- 2001
- Publisher
- Springer-Verlag Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- eBook ISBN
- 978-3-540-44679-8
- DOI
- 10.1007/3-540-44679-6
- Softcover ISBN
- 978-3-540-42494-9
- Series ISSN
- 0302-9743
- Edition Number
- 1
- Number of Pages
- XIV, 606
- Topics
*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works are not included.
