Show simple item record

18.405J / 6.841J Advanced Complexity Theory, Fall 2001

dc.contributor.authorSpielman, Danielen_US
dc.coverage.temporalFall 2001en_US
dc.date.issued2001-12
dc.identifier18.405J-Fall2001
dc.identifierlocal: 18.405J
dc.identifierlocal: 6.841J
dc.identifierlocal: IMSCP-MD5-17ef14b11d817b8c0b2d7ef9644f8df2
dc.identifier.urihttp://hdl.handle.net/1721.1/106671
dc.description.abstractThe 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.languageen-USen_US
dc.rights.uriUsage 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.uriUsage Restrictions: Attribution-NonCommercial-ShareAlike 3.0 Unporteden_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.subjectBasic time and space classesen_US
dc.subjectpolynomial-time hierarchyen_US
dc.subjectRandomized classes: RP, BPP, RL, and their relation to PHen_US
dc.subjectCounting classes: #Pen_US
dc.subjectBasic time and space classesen_US
dc.subjectpolynomial-time hierarchyen_US
dc.subjectRandomized classes: RP, BPP, RL, and their relation to PHen_US
dc.subjectCounting classes: #Pen_US
dc.subjectNon-uniform classesen_US
dc.subjectOracles, relativizationen_US
dc.subjectInteractive proof systemsen_US
dc.subjectPseudo-random generatorsen_US
dc.subjectrandomnessen_US
dc.subjectSome circuit lower bounds--monotone and AC0.en_US
dc.subjectoraclesen_US
dc.subjectrelativizationen_US
dc.subjectrandomized classesen_US
dc.subjectRPen_US
dc.subjectBPPen_US
dc.subjectRLen_US
dc.subjectPHen_US
dc.subjectcircuit lower bondsen_US
dc.subjectmonotoneen_US
dc.subjectAC0en_US
dc.subjectbasic time classesen_US
dc.subjectbasic space classesen_US
dc.subject18.405Jen_US
dc.subject6.841Jen_US
dc.subject18.405en_US
dc.subject6.841en_US
dc.title18.405J / 6.841J Advanced Complexity Theory, Fall 2001en_US
dc.title.alternativeAdvanced Complexity Theoryen_US


Files in this item

Thumbnail
Name:
18-405j-fall-2001/contents/ind ...
Size:
34.16Kb
Format:
HTML
View/Open

This item appears in the following Collection(s)

Show simple item record