Advanced Search
DSpace@MIT

18.405J / 6.841J Advanced Complexity Theory, Fall 2001

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Spielman, Daniel en_US
dc.coverage.temporal Fall 2001 en_US
dc.date.issued 2001-12
dc.identifier 18.405J-Fall2001
dc.identifier local: 18.405J
dc.identifier local: 6.841J
dc.identifier local: IMSCP-MD5-17ef14b11d817b8c0b2d7ef9644f8df2
dc.identifier.uri http://hdl.handle.net/1721.1/106671
dc.description.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. en_US
dc.language en-US en_US
dc.rights.uri 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. en_US
dc.rights.uri Usage Restrictions: Attribution-NonCommercial-ShareAlike 3.0 Unported en_US
dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/ en_US
dc.subject Basic time and space classes en_US
dc.subject polynomial-time hierarchy en_US
dc.subject Randomized classes: RP, BPP, RL, and their relation to PH en_US
dc.subject Counting classes: #P en_US
dc.subject Basic time and space classes en_US
dc.subject polynomial-time hierarchy en_US
dc.subject Randomized classes: RP, BPP, RL, and their relation to PH en_US
dc.subject Counting classes: #P en_US
dc.subject Non-uniform classes en_US
dc.subject Oracles, relativization en_US
dc.subject Interactive proof systems en_US
dc.subject Pseudo-random generators en_US
dc.subject randomness en_US
dc.subject Some circuit lower bounds--monotone and AC0. en_US
dc.subject oracles en_US
dc.subject relativization en_US
dc.subject randomized classes en_US
dc.subject RP en_US
dc.subject BPP en_US
dc.subject RL en_US
dc.subject PH en_US
dc.subject circuit lower bonds en_US
dc.subject monotone en_US
dc.subject AC0 en_US
dc.subject basic time classes en_US
dc.subject basic space classes en_US
dc.subject 18.405J en_US
dc.subject 6.841J en_US
dc.subject 18.405 en_US
dc.subject 6.841 en_US
dc.title 18.405J / 6.841J Advanced Complexity Theory, Fall 2001 en_US
dc.title.alternative Advanced Complexity Theory en_US


Files in this item

Name Size Format Description
18-405j-fall-2001 ... 34.16Kb HTML

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage