Dagstuhl Seminar Proceedings 06391

Algorithms and Complexity for Continuous Problems

S. Dahlke, K. Ritter, I. H. Sloan, J. F. Traub (Eds.)

published by LZI
Host

ISSN  1862 - 4405

Dagstuhl Seminar 06391, 24.09. - 29.09.2006
Additional Information
Seminar Homepage
License
Search Publication Server

Authors
  • Barnum, Howard
  • Dahlke, Stephan
  • Meer, Klaus
  • Ritter, Klaus
  • Sloan, Ian H.
  • Traub, Joseph F.
  • Ziegler, Martin

  •   
    06391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems
    Authors: Dahlke, Stephan ; Ritter, Klaus ; Sloan, Ian H. ; Traub, Joseph F.

    Abstract | Document (264 KB) | BibTeX

    Real Computational Universality: The Word Problem for a class of groups with infinite presentation
    Authors: Meer, Klaus ; Ziegler, Martin

    Abstract | Document (200 KB) | BibTeX

    Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
    Authors: Barnum, Howard

    Abstract | Document (249 KB) | BibTeX

      




    DROPS-Home | Fulltext Search | Imprint
    Published by LZI