Dagstuhl Seminar Proceedings: Algebraic Methods in Computational Complexity 2004
Harry Buhrman, Lance Fortnow, Thomas Thierauf (Eds.): Algebraic Methods in Computational Complexity, 10.-15. October 2004. IBFI, Schloss Dagstuhl, Germany 2005 Dagstuhl Seminar Proceedings 04421- William I. Gasarch, James Glenn, Andrey Utis: The communication complexity of the Exact-N Problem revisited.
- Judy Goldsmith: Preferences and Domination.
- Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler: Randomized QuickSort and the Entropy of the Random Source.
- William I. Gasarch, Frank Stephan: Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults.
- Jörg Rothe: Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy.
- Harry Buhrman, Lance Fortnow, Thomas Thierauf: 04421 Abstracts Collection - Algebraic Methods in Computational Complexity.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team