Searching for Hadamard code : 1 results found | RSS Feed for this search
18.405J Advanced Complexity Theory (MIT)
DescriptionThis graduate-level course focuses on current research topics in computational complexity theory. Topics include: Nondeterministic, alternating, probabilistic, and parallel computation models; Boolean circuits; Complexity classes and complete sets; The polynomial-time hierarchy; Interactive proof systems; Relativization; Definitions of randomness; Pseudo-randomness and derandomizations;Interactive proof systems and probabilistically checkable proofs.
Subjects18.405 | 6.841 | Polynomial hierarchy | time-space lower bounds | approximate counting | ?s Theorem | Relativization | Baker-Gill-Solovay | switching lemma | Razborov-Smolensky | NEXP vs. ACC0 | Communication complexity | PCP theorem | Hadamard code | Gap amplification | Natural proofs
LicenseContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm