DS-1-11 Reconstructing Strings from Substrings with Quantum Query
スポンサーリンク
概要
- 論文の詳細を見る
- 2011-02-28
著者
-
IWAMA KAZUO
School of Informatics, Kyoto University
-
NISHIMURA HARUMICHI
School of Science, Osaka Prefecture University
-
YAMASHITA SHIGERU
College of Information Science and Engineering, Ritsumeikan University
-
Iwama Kazuo
School Of Informatics Kyoto University
-
Nishimura Harumichi
School Of Science Osaka Prefecture University
-
Cleve Richard
Institute for Quantum Computing and School of Computer Science, University of Waterloo
-
Le Gal
Department of Computer Science, The University of Tokyo
-
Tani Seiichiro
Quantum Computation and Information Project, ERATO-SORST, JST.
-
Teruyama Junichi
School of Informatics, Kyoto University
-
Tani Seiichiro
Quantum Computation And Information Project Erato-sorst Jst.:ntt Communication Science Laboratories
-
Teruyama Junichi
School Of Informatics Kyoto University
-
Le Gal
Department Of Computer Science The University Of Tokyo
-
Cleve Richard
Institute For Quantum Computing And School Of Computer Science University Of Waterloo:perimeter Inst
-
Yamashita Shigeru
College Of Information Science And Engineering Ritsumeikan University.
関連論文
- Average/Worst-Case Gap of Quantum Query Complexities
- Recent Developments in Mesh Routing Algorithms(Special Issue on Algorithm Engineering : Surveys)
- The Axis-bound CNN Problem(Algorithms and Data Structures)
- DS-1-2 Packing Squares with Profits into a Rectangle
- Approximated Vertex Cover for Graphs with Perfect Matchings(Invited Papers from New Horizons in Computing)
- DS-1-11 Reconstructing Strings from Substrings with Quantum Query
- An almost optimal algorithm for Winkler's sorting pairs in bins (コンピュテーシヨン)
- Reconstructing Strings from Substrings with Quantum Queries
- Selective Check of Data-Path for Effective Fault Tolerance