Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
Look up keyword or section
Like this

Table Of Contents

1 Preface
2 Recursive Functions
2.1 Primitive Recursive Functions
2.2 Partial recursive functions
2.3 Turing Machines
2.4 Church’s thesis
2.5 Functions, sets and languages
2.6 Recursively enumerable sets
2.7 Some facts about recursively enumerable sets
2.8 G¨odel’s incompleteness theorem
2.10 Answers to exercises
3 Efficient computation, hierarchy theorems
3.1 Basic Definitions
3.2 Hierarchy theorems
4 The complexity classes L, P and PSPACE
4.1 Is the definition of P model dependent?
4.2 Examples of members in the complexity classes
5 Nondeterministic computation
5.1 Nondeterministic Turing machines
6 Relations among complexity classes
6.1 Nondeterministic space vs. deterministic time
6.2 Nondeterministic time vs. deterministic space
6.3 Deterministic space vs. nondeterministic space
7 Complete problems
7.1 NP-complete problems
7.2 PSPACE-complete problems
7.3 P-complete problems
7.4 NL-complete problems
8 Constructing more complexity-classes
11.2 NC
0 of .
Results for:
No results containing your search query
P. 1
Complexity Lecture Notes

Complexity Lecture Notes

Ratings: (0)|Views: 68|Likes:
Published by Anand Kumar

More info:

Published by: Anand Kumar on Feb 22, 2012
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 4 to 26 are not shown in this preview.
You're Reading a Free Preview
Pages 29 to 130 are not shown in this preview.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->