Video Lectures AllHistorical StudiesMathematicsNatural SciencesSocial ScienceProspects in Theoretical PhysicsWomen and MathematicsFriends of the InstituteMore search optionsTitleYearTags Separate tags with a comma. SpeakerItems per page5102550Sort byDate AscDate DescTitle AscTitle Descvideo lecture PMSP - Regularity Lemmas in graph theory, additive combinatorics and TCS I June 15, 2010Luca Trevisan Read More video lecture PMSP - Expander graphs: Applications and combinatorial constructions II June 15, 2010Avi Wigderson Read More video lecture PMSP - Expander graphs: Applications and combinatorial constructions I June 15, 2010Avi Wigderson Read More video lecture PMSP - Computational pseudo-randomness and extractors II June 14, 2010Russell Impagliazzo Read More video lecture PMSP - Computational pseudo-randomness and extractors I June 14, 2010Russell Impagliazzo Read More video lecture PMSP - Approximate algebraic structure (groups, fields, homomorphisms, ...) II June 14, 2010Ben Green Read More video lecture PMSP - Approximate algebraic structure (groups, fields, homomorphisms, ...) I June 14, 2010Ben Green Read More video lecture Workshop on Pseudorandomness in Mathematical Structures June 14, 2010June 14 - 18, 2010Organizers: Jean Bourgain, Russell Impagliazzo, Peter Sarnak and Avi WigdersonWorkshop Homepage:http://www.ias.edu/math/pseudo2010Program: http://www.ias.edu/math/pseudo2010/program.The workshop is funded by the National... Read More video lecture The Stepanov Method May 25, 2010Avi WigdersonThe Stepanov method is an elementary method for proving bounds on the number of roots of polynomials. At its core is the following idea. To upper bound the number of roots of a polynomial f(x) in a field, one sets up an auxiliary polynomial F... Read More video lecture Subsampling Mathematical Relaxations and Average-case Complexity May 24, 2010Boaz BarakWe consider the following two questions:Is the MAX-CUT problem hard on random geometric graphs of the type considered by Feige and Schechtman (2002)?Is the value of a mathematical relaxation such as semi-definite programming (SDP) for a constraint... Read More PaginationFirst page« FirstPrevious page‹ Previous… Page 383 Page 384 Page 385 Page 386 Current page 387 Page 388 Page 389 Page 390 Page 391…Next pageNext ›Last pageLast »
video lecture PMSP - Regularity Lemmas in graph theory, additive combinatorics and TCS I June 15, 2010Luca Trevisan Read More
video lecture PMSP - Expander graphs: Applications and combinatorial constructions II June 15, 2010Avi Wigderson Read More
video lecture PMSP - Expander graphs: Applications and combinatorial constructions I June 15, 2010Avi Wigderson Read More
video lecture PMSP - Computational pseudo-randomness and extractors II June 14, 2010Russell Impagliazzo Read More
video lecture PMSP - Computational pseudo-randomness and extractors I June 14, 2010Russell Impagliazzo Read More
video lecture PMSP - Approximate algebraic structure (groups, fields, homomorphisms, ...) II June 14, 2010Ben Green Read More
video lecture PMSP - Approximate algebraic structure (groups, fields, homomorphisms, ...) I June 14, 2010Ben Green Read More
video lecture Workshop on Pseudorandomness in Mathematical Structures June 14, 2010June 14 - 18, 2010Organizers: Jean Bourgain, Russell Impagliazzo, Peter Sarnak and Avi WigdersonWorkshop Homepage:http://www.ias.edu/math/pseudo2010Program: http://www.ias.edu/math/pseudo2010/program.The workshop is funded by the National... Read More
video lecture The Stepanov Method May 25, 2010Avi WigdersonThe Stepanov method is an elementary method for proving bounds on the number of roots of polynomials. At its core is the following idea. To upper bound the number of roots of a polynomial f(x) in a field, one sets up an auxiliary polynomial F... Read More
video lecture Subsampling Mathematical Relaxations and Average-case Complexity May 24, 2010Boaz BarakWe consider the following two questions:Is the MAX-CUT problem hard on random geometric graphs of the type considered by Feige and Schechtman (2002)?Is the value of a mathematical relaxation such as semi-definite programming (SDP) for a constraint... Read More
