Stop the war!
Остановите войну!
for scientists:
default search action
Dagstuhl Seminar Proceedings: Algebraic Methods in Computational Complexity 2007
- Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf:
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.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.