Theories of Computational Complexity

Free Download

Authors:

Edition: 1s

Series: Annals of discrete mathematics 35

ISBN: 978-0-444-70356-9, 044470356X

Size: 2 MB (2211664 bytes)

Pages: ii-ix, 1-487/498

File format:

Language:

Publishing Year:

Category:

Cristian Calude (Eds.)978-0-444-70356-9, 044470356X


Table of contents :
Content:
Advisory Editors
Page ii

Edited by
Page iii

Copyright page
Page iv

Dedication
Page v

Preface
Pages vii-ix
Cristian Calude

Introduction
Pages 1-2

Chapter 1 Primitive Recursive Hierarchies
Pages 3-85

Chapter 2 Recursive Functions
Pages 87-206

Chapter 3 Blum’s Complexity Theory
Pages 207-296

Chapter 4 Kolmogorov and Martin-Lof’s Complexity Theory
Pages 297-381

Chapter 5 Subrecursive Programming Hierarchies
Pages 383-451

Bibliography
Pages 453-468

Index of Notations
Pages 469-474

Subject Index
Pages 475-480

Author Index
Pages 481-487

Reviews

There are no reviews yet.

Be the first to review “Theories of Computational Complexity”
Shopping Cart
Scroll to Top