18.405J / 6.841J Advanced Complexity Theory, Fall 2001
Name
18-405j-fall-2001/contents/index.htm
Size
34.17 KB
Format
HTML
Checksum (MD5)
7bea23c2bb45cd315a22442ab9ee0cf3
Author(s)
Spielman, Daniel
Alternative Title
Advanced Complexity Theory
Date Issued
December 2001
Abstract
The topics for this course cover various aspects of complexity theory, such as the basic time and space classes, the polynomial-time hierarchy and the randomized classes . This is a pure theory class, so no applications were involved.
Subjects
Basic time and space classes
polynomial-time hierarchy
Randomized classes: RP, BPP, RL, and their relation to PH
Counting classes: #P
Basic time and space classes
polynomial-time hierarchy
Randomized classes: RP, BPP, RL, and their relation to PH
Counting classes: #P
Non-uniform classes
Oracles, relativization
Interactive proof systems
Pseudo-random generators
randomness
Some circuit lower bounds--monotone and AC0.
oracles
relativization
randomized classes
RP
BPP
RL
PH
circuit lower bonds
monotone
AC0
basic time classes
basic space classes
18.405J
6.841J
18.405
6.841
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Persistent DSpace Link
