Manindra Agrawal, Harry Buhrman, Lance Fortnow, and Thomas Thierauf. 07411 Abstracts Collection – Algebraic Methods in Computational Complexity. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 7411, pp. 1-13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{agrawal_et_al:DagSemProc.07411.1, author = {Agrawal, Manindra and Buhrman, Harry and Fortnow, Lance and Thierauf, Thomas}, title = {{07411 Abstracts Collection – Algebraic Methods in Computational Complexity}}, booktitle = {Algebraic Methods in Computational Complexity}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7411}, editor = {Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07411.1}, URN = {urn:nbn:de:0030-drops-13072}, doi = {10.4230/DagSemProc.07411.1}, annote = {Keywords: Computational complexity, algebra, quantum computing, (de-) randomization} }
Manindra Agrawal, Harry Buhrman, Lance Fortnow, and Thomas Thierauf. 07411 Executive Summary – Algebraic Methods in Computational Complexity. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 7411, pp. 1-3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{agrawal_et_al:DagSemProc.07411.2, author = {Agrawal, Manindra and Buhrman, Harry and Fortnow, Lance and Thierauf, Thomas}, title = {{07411 Executive Summary – Algebraic Methods in Computational Complexity}}, booktitle = {Algebraic Methods in Computational Complexity}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7411}, editor = {Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07411.2}, URN = {urn:nbn:de:0030-drops-13061}, doi = {10.4230/DagSemProc.07411.2}, annote = {Keywords: Computational complexity, algebra, quantum computing, (de-) randomization} }
Farid Ablayev. Classical Simulation Complexity of Quantum Branching Programs. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 7411, pp. 1-10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{ablayev:DagSemProc.07411.3, author = {Ablayev, Farid}, title = {{Classical Simulation Complexity of Quantum Branching Programs}}, booktitle = {Algebraic Methods in Computational Complexity}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7411}, editor = {Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07411.3}, URN = {urn:nbn:de:0030-drops-13107}, doi = {10.4230/DagSemProc.07411.3}, annote = {Keywords: Quantum algorithms, Branching Programs, Complexity} }
Nitin Saxena. Diagonal Circuit Identity Testing and Lower Bounds. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 7411, p. 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{saxena:DagSemProc.07411.4, author = {Saxena, Nitin}, title = {{Diagonal Circuit Identity Testing and Lower Bounds}}, booktitle = {Algebraic Methods in Computational Complexity}, pages = {1--1}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7411}, editor = {Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07411.4}, URN = {urn:nbn:de:0030-drops-13087}, doi = {10.4230/DagSemProc.07411.4}, annote = {Keywords: Arithmetic circuit, identity testing, depth 3, depth 4, determinant, permanent, lower bound} }
Nikolai K. Vereshchagin, Harry Buhrman, Matthias Cristandl, Michal Koucky, Zvi Lotker, and Boaz Patt-Shamir. High Entropy Random Selection Protocols. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 7411, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{vereshchagin_et_al:DagSemProc.07411.5, author = {Vereshchagin, Nikolai K. and Buhrman, Harry and Cristandl, Matthias and Koucky, Michal and Lotker, Zvi and Patt-Shamir, Boaz}, title = {{High Entropy Random Selection Protocols}}, booktitle = {Algebraic Methods in Computational Complexity}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7411}, editor = {Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07411.5}, URN = {urn:nbn:de:0030-drops-13091}, doi = {10.4230/DagSemProc.07411.5}, annote = {Keywords: Shannon entropy, Random string ds} }
Julia Kempe, Oded Regev, and Ben Toner. The Unique Games Conjecture with Entangled Provers is False. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 7411, pp. 1-17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{kempe_et_al:DagSemProc.07411.6, author = {Kempe, Julia and Regev, Oded and Toner, Ben}, title = {{The Unique Games Conjecture with Entangled Provers is False}}, booktitle = {Algebraic Methods in Computational Complexity}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7411}, editor = {Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07411.6}, URN = {urn:nbn:de:0030-drops-13048}, doi = {10.4230/DagSemProc.07411.6}, annote = {Keywords: Unique games, entanglement} }
Frederic Green and Amitabha Roy. Uniqueness of Optimal Mod 3 Circuits for Parity. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 7411, pp. 1-15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{green_et_al:DagSemProc.07411.7, author = {Green, Frederic and Roy, Amitabha}, title = {{Uniqueness of Optimal Mod 3 Circuits for Parity}}, booktitle = {Algebraic Methods in Computational Complexity}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7411}, editor = {Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07411.7}, URN = {urn:nbn:de:0030-drops-13059}, doi = {10.4230/DagSemProc.07411.7}, annote = {Keywords: Circuit complexity, correlations, exponential sums} }
Feedback for Dagstuhl Publishing