Norms, XOR lemmas, and lower bounds for GF(2) polynomials and multiparty protocols
Sunday July 1, 2007
Complexity Theory
Avi Wigderson (Institute for Advanced Study) - Emanuele Viola (Institute for Advanced Study) bibTeX
[pdf] [ps]
Sunday July 1, 2007
Complexity Theory
Avi Wigderson (Institute for Advanced Study) - Emanuele Viola (Institute for Advanced Study) bibTeX
@article{ias306,
title={Norms, XOR lemmas, and lower bounds for GF(2) polynomials and multiparty protocols},
author={Avi Wigderson (Institute for Advanced Study) - Emanuele Viola (Institute for Advanced Study)},
journal={IEEE Conference on Computational Complexity},
year={2007},
}
[ Close ]
[pdf] [ps]
P, NP and Mathematics - a computational complexity perspective
Thursday December 21, 2006
Complexity Theory
Avi Wigderson (Institute for Advanced Study) bibTeX
[pdf] [ps]
Thursday December 21, 2006
Complexity Theory
Avi Wigderson (Institute for Advanced Study) bibTeX
@article{ias307,
title={P, NP and Mathematics - a computational complexity perspective},
author={Avi Wigderson (Institute for Advanced Study)},
journal={Proceedings of the ICM 2006},
volume={1},
pages={665-712},
year={2007},
}
[ Close ]
[pdf] [ps]
Non-interactive Correlation Distillation, Inhomogeneous Markov Chains, and the Reverse Bonami-Beckner Inequality
Wednesday December 22, 2004
Cryptography
Elchanan Mossel (U.C. Berkeley) - Ryan O Donnell (Institute for Advanced Study) - Oded Regev (Tel-Aviv University) - Jeffrey E. Steif (Chalmers University of Technology)
[pdf] [url]
Wednesday December 22, 2004
Cryptography
Elchanan Mossel (U.C. Berkeley) - Ryan O Donnell (Institute for Advanced Study) - Oded Regev (Tel-Aviv University) - Jeffrey E. Steif (Chalmers University of Technology)
[pdf] [url]
"A Tool to Recover Past Histories": Genealogy and Identity after the Genome
Wednesday December 1, 2004
Quantum Computation
Nadia Abu El-Haj (Institute for Advanced Study)
[pdf]
Wednesday December 1, 2004
Quantum Computation
Nadia Abu El-Haj (Institute for Advanced Study)
[pdf]
Lower Bounds for k-DNF Resolution on Random 3-CNFs
Wednesday November 3, 2004
Proof complexity
Michael Alekhnovich (Institute for Advanced Study)
[pdf] [url]
Wednesday November 3, 2004
Proof complexity
Michael Alekhnovich (Institute for Advanced Study)
[pdf] [url]
Learnability and Automatizability
Sunday October 17, 2004
Proof complexity
Misha Alekhnovich (Institute for Advanced Study) - Mark Braverman (University of Toronto) - Vitaly Feldman (Harvard University) - Adam R. Klivans (Toyota Technological Institute) - Toniann Pitassi (Institute For Advanced Study and University of Toronto) bibTeX
[ps] [url]
Sunday October 17, 2004
Proof complexity
Misha Alekhnovich (Institute for Advanced Study) - Mark Braverman (University of Toronto) - Vitaly Feldman (Harvard University) - Adam R. Klivans (Toyota Technological Institute) - Toniann Pitassi (Institute For Advanced Study and University of Toronto) bibTeX
@article{ias153,
title={Learnability and Automatizability},
author={Misha Alekhnovich (Institute for Advanced Study) - Mark Braverman (University of Toronto) - Vitaly Feldman (Harvard University) - Adam R. Klivans (Toyota Technological Institute) - Toniann Pitassi (Institute For Advanced Study and University of Toronto)},
journal={Proceedings of the 45th Symposium on Foundations of Computer Science},
}
[ Close ]
[ps] [url]
Universally Composable Protocols with Relaxed Set-Up Assumptions
Sunday October 17, 2004
Cryptography
Boaz Barak (Institute for Advanced Study) - Ran Canetti (IBM T.J. Watson Research Center) - Jesper Buus Nielsen (ETH Zürich) - Rafael Pass (Massachusetts Institute of Technology) bibTeX
[ps]
Sunday October 17, 2004
Cryptography
Boaz Barak (Institute for Advanced Study) - Ran Canetti (IBM T.J. Watson Research Center) - Jesper Buus Nielsen (ETH Zürich) - Rafael Pass (Massachusetts Institute of Technology) bibTeX
@article{ias162,
title={Universally Composable Protocols with Relaxed Set-Up Assumptions},
author={Boaz Barak (Institute for Advanced Study) - Ran Canetti (IBM T.J. Watson Research Center) - Jesper Buus Nielsen (ETH Zürich) - Rafael Pass (Massachusetts Institute of Technology)},
journal={Proceedings of the 45th Symposium on Foundations of Computer Science},
}
[ Close ]
[ps]
Hardness of Approximating the Shortest Vector Problem in Lattices
Sunday October 17, 2004
Cryptography
Subhash Khot (Georgia Tech University) bibTeX
[ps]
Sunday October 17, 2004
Cryptography
Subhash Khot (Georgia Tech University) bibTeX
@article{ias165,
title={Hardness of Approximating the Shortest Vector Problem in Lattices},
author={Subhash Khot (Georgia Tech University)},
journal={Proceedings of the 45th Symposium on Foundations of Computer Science},
}
[ Close ]
[ps]
Ruling out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique,
Sunday October 17, 2004
Cryptography
Subhash Khot (Georgia Tech University) bibTeX
[ps]
Sunday October 17, 2004
Cryptography
Subhash Khot (Georgia Tech University) bibTeX
@article{ias166,
title={Ruling out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique,},
author={Subhash Khot (Georgia Tech University)},
journal={Proceedings of the 45th Symposium on Foundations of Computer Science},
}
[ Close ]
[ps]
Extracting Randomness from Few Independent Sources
Thursday October 14, 2004
Derandomization and explicit constructions
Boaz Barak (Institute for Advanced Study) - Russell Impagliazzo (weyl.math.northwestern.edu) - Avi Wigderson (Institute for Advanced Study) bibTeX
[ps] [url]
Thursday October 14, 2004
Derandomization and explicit constructions
Boaz Barak (Institute for Advanced Study) - Russell Impagliazzo (weyl.math.northwestern.edu) - Avi Wigderson (Institute for Advanced Study) bibTeX
@article{ias149,
title={Extracting Randomness from Few Independent Sources},
author={Boaz Barak (Institute for Advanced Study) - Russell Impagliazzo (weyl.math.northwestern.edu) - Avi Wigderson (Institute for Advanced Study)},
journal={Proceedings of the 45th Symposium on Foundations of Computer Science},
}
[ Close ]
[ps] [url]
