Title |
Complexity bounds on some fundamental computational problems for quantum branching programs / vorgelegt von Airat Khasianov |
|---|---|
Involved |
Airat Khasianov (Verfasser) |
Published |
2005 |
Extent |
XVIII, 172 S. : graph. Darst. |
Thesis |
Bonn, Univ., Diss., 2005 (Nicht für den Austausch) |
Language |
|
Topic |
|
Subject |
Quantencomputer, OBDD, Berechnungskomplexität, Untere Schranke, Obere Schranke, Hidden-subgroup-Problem |
Other editions |
Erscheint auch als Online-Ausgabe: Complexity bounds on some fundamental computational problems for quantum branching programs |
Record ID |
976328860 |
Please note
The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link: