Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this

Table Of Contents

0 Introduction and Preliminaries
0.1 The subject of complexity theory
0.2 Some notation and definitions
1 Models of Computation
1.1 Introduction
1.2 Finite automata
1.3 The Turing machine
1.4 The Random Access Machine
2.1 Introduction
2.2 Recursive and recursively enumerable languages
2.3 Other undecidable problems
2.4 Computability in logic
3 Computation with resource bounds
3.1 Introduction
3.2 Time and space
3.3 Polynomial time I: Algorithms in arithmetic
3.4 Polynomial time II: Graph algorithms
3.5 Polynomial space
4 General theorems on space and time complexity
4.1 Space versus time
5 Non-deterministic algorithms
5.1 Non-deterministic Turing machines
5.2 Witnesses and the complexity of non-deterministic algorithms
5.3 General results on nondeterministic complexity classes
5.4 Examples of languages in NP
5.5 NP-completeness
5.6 Further NP-complete problems
6 Randomized algorithms
6.1 Introduction
6.2 Verifying a polynomial identity
6.3 Prime testing
6.4 Randomized complexity classes
7 Information complexity: the complexity-theoretic notion of randomness
7.1 Introduction
7.2 Information complexity
7.3 The notion of a random sequence
7.4 Kolmogorov complexity and data compression
8 Pseudo-random numbers
8.1 Introduction
8.2 Introduction
8.3 Classical methods
8.4 The notion of a psuedorandom number generator
8.5 One-way functions
8.6 Discrete square roots
9.1 Parallel random access machines
9.2 The class NC
10 Decision trees
10.1 Algorithms using decision trees
10.2 The notion of decision trees
10.3 Nondeterministic decision trees
10.4 Lower bounds on the depth of decision trees
11 Communication complexity
11.1 Communication matrix and protocol-tree
11.2 Some protocols
11.3 Non-deterministic communication complexity
11.4 Randomized protocols
12 The complexity of algebraic computations
13 Circuit complexity
13.1 Introduction
13.2 Lower bound for the Majority Function
13.3 Monotone circuits
14 An application of complexity: cryptography
14.1 A classical problem
14.2 A simple complexity-theoretic model
14.3 Public-key cryptography
14.4 The Rivest-Shamir-Adleman code
0 of .
Results for:
No results containing your search query
P. 1
Complexity of Algorithms Lctn - Peter Gacs

Complexity of Algorithms Lctn - Peter Gacs

Ratings: (0)|Views: 89 |Likes:
Published by --m-m--m--m-m-m

More info:

Published by: --m-m--m--m-m-m on Oct 14, 2009
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 14 are not shown in this preview.
You're Reading a Free Preview
Pages 18 to 25 are not shown in this preview.
You're Reading a Free Preview
Pages 29 to 32 are not shown in this preview.
You're Reading a Free Preview
Pages 36 to 136 are not shown in this preview.
You're Reading a Free Preview
Pages 140 to 180 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)//-->