18.409 Topics in Theoretical Computer Science: An Algorithmist's Toolkit, Fall 2007

LinkKelner, Jonathan, 1980-

Author(s)

LinkKelner, Jonathan, 1980-

Download18-409Fall-2007/OcwWeb/Mathematics/18-409Fall-2007/CourseHome/index.htm (13.02Kb)

Alternative title

Topics in Theoretical Computer Science: An Algorithmist's Toolkit

Terms of use

Usage Restrictions: This site (c) Massachusetts Institute of Technology 2010. 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.

Metadata

Show full item record

Abstract

Study of an area of current interest in theoretical computer science. Topic varies from term to term.

Date issued

2007-12

URI

http://hdl.handle.net/1721.1/55908

Other identifiers

18.409-Fall2007

local: 18.409

local: IMSCP-MD5-ce01691486f48e81a762805694212130

Keywords

Spectral graph theory, Iterative methods for linear algebra, Convex geometry, Lattices and basis reduction, LPs and SDPs for approximating NP-hard problems, Graph Laplacians, Cheeger inequalities, Fritz John’s theorem

Collections

Mathematics (18) - Archived