
Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1950)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Similar content being viewed by others
Keywords
Table of contents (8 chapters)
Authors and Affiliations
Bibliographic Information
Book Title: Randomness and Completeness in Computational Complexity
Authors: Dieter Melkebeek
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-44545-5
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2000
Softcover ISBN: 978-3-540-41492-6Published: 13 December 2000
eBook ISBN: 978-3-540-44545-6Published: 29 June 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 198
Topics: Programming Techniques, Theory of Computation, Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Logics and Meanings of Programs