18.405J / 6.841J Advanced Complexity Theory, Fall 2001

Author(s)
Spielman, Daniel
Thumbnail
Download18-405j-fall-2001/contents/index.htm (34.16Kb)
Alternative title
Advanced Complexity Theory
Terms of use
Usage Restrictions: This site (c) Massachusetts Institute of Technology 2017. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. Usage Restrictions: Attribution-NonCommercial-ShareAlike 3.0 Unported http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
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.
Date issued
2001-12
URI
http://hdl.handle.net/1721.1/106671
Department
Massachusetts Institute of Technology. Department of Mathematics; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Other identifiers
18.405J-Fall2001
local: 18.405J
local: 6.841J
local: IMSCP-MD5-17ef14b11d817b8c0b2d7ef9644f8df2
Keywords
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
Collections