Dagstuhl Seminar Proceedings 04421

Algebraic Methods in Computational Complexity

H. Buhrman, L. Fortnow, T. Thierauf (Eds.)

published by LZI
Host

ISSN  1862 - 4405

Dagstuhl Seminar 04421, 10.10. - 15.10.2004
Additional Information
Seminar Homepage
License
Search Publication Server

Authors
  • Buhrman, Harry
  • Fortnow, Lance
  • Gasarch, William
  • Glenn, James
  • Goldsmith, Judy
  • List, Beatrice
  • Maucher, Markus
  • Rothe, Jörg
  • Schuler, Rainer
  • Schöning, Uwe
  • Stephan, Frank
  • Thierauf, Thomas
  • Utis, Andre
    		•

    		  
    04421 Abstracts Collection -- Algebraic Methods in Computational Complexity
    Authors: Buhrman, Harry ; Fortnow, Lance ; Thierauf, Thomas

    Abstract | Document (225 KB) | BibTeX

    Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy
    Authors: Rothe, Jörg

    Abstract | Document (358 KB) | BibTeX

    Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults
    Authors: Gasarch, William ; Stephan, Frank

    Abstract | Document (237 KB) | BibTeX

    Preferences and Domination
    Authors: Goldsmith, Judy

    Abstract | Document (240 KB) | BibTeX

    Randomized QuickSort and the Entropy of the Random Source
    Authors: List, Beatrice ; Maucher, Markus ; Schöning, Uwe ; Schuler, Rainer

    Abstract | Document (209 KB) | BibTeX

    The communication complexity of the Exact-N Problem revisited
    Authors: Gasarch, William ; Glenn, James ; Utis, Andre

    Abstract | Document (278 KB) | BibTeX

    		  



    DROPS-Home | Imprint | Privacy
    Published by LZI