Stop the war!
Остановите войну!
for scientists:
default search action
Dagstuhl Seminar Proceedings: Algebraic Methods in Computational Complexity 2004
- Harry Buhrman, Lance Fortnow, Thomas Thierauf:
Algebraic Methods in Computational Complexity, 10.-15. October 2004. Dagstuhl Seminar Proceedings 04421, IBFI, Schloss Dagstuhl, Germany 2005 - 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.
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.