@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing