Dagstuhl Seminar Proceedings:
Algebraic Methods in Computational Complexity 2007
Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf (Eds.):
Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007.
Dagstuhl Seminar Proceedings 07411 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 
- Julia Kempe, Oded Regev, Ben Toner:
The Unique Games Conjecture with Entangled Provers is False.
- Frederic Green, Amitabha Roy:
Uniqueness of Optimal Mod 3 Circuits for Parity.
- Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf:
07411 Executive Summary -- Algebraic Methods in Computational Complexity.
- Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf:
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity.
- Nitin Saxena:
Diagonal Circuit Identity Testing and Lower Bounds.
- Farid M. Ablayev:
Classical Simulation Complexity of Quantum Branching Programs.
- Nikolai K. Vereshchagin, Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir:
High Entropy Random Selection Protocols.
Last update Thu May 24 04:15:53 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
