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.
Dagstuhl Seminar Proceedings 04421 IBFI, Schloss Dagstuhl, Germany 2005 BibTeX
- William I. Gasarch, James Glenn, Andrey Utis:
The communication complexity of the Exact-N Problem revisited.
Electronic Edition (link) BibTeX
- Judy Goldsmith:
Preferences and Domination.
Electronic Edition (link) BibTeX
- Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
Randomized QuickSort and the Entropy of the Random Source.
Electronic Edition (link) BibTeX
- William I. Gasarch, Frank Stephan:
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults.
Electronic Edition (link) BibTeX
- Jörg Rothe:
Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy.
Electronic Edition (link) BibTeX
- Harry Buhrman, Lance Fortnow, Thomas Thierauf:
04421 Abstracts Collection - Algebraic Methods in Computational Complexity.
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:04:52 2009
by Michael Ley (ley@uni-trier.de)