Author:
Kawahara Jun,Saitoh Toshiki,Yoshinaka Ryo
Publisher
Springer International Publishing
Reference15 articles.
1. Bitton, D., DeWitt, D.J., Hsiao, D.K., Menon, J.: A taxonomy of parallel sorting. ACM Comput. Surv. 16(3), 287–318 (1984)
2. Bonnet, É., Miltzow, T., Rzążewski, P.: Complexity of Token Swapping and Its Variants. CoRR, abs/1607.07676 (2016)
3. Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449–467 (1965)
4. Even, S., Goldreich, O.: The minimum-length generator sequence problem is NP-hard. J. Algorithms 2(3), 311–313 (1981)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sorting Permutations on an n − Broom;Mathematics;2024-08-24
2. Effective and Efficient Qubit Mapper;2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD);2023-10-28
3. Sorting Permutations with 3-Brooms;2023 4th IEEE Global Conference for Advancement in Technology (GCAT);2023-10-06
4. Polynomial time algorithms for the Token Swapping Problem on cographs;RAIRO - Operations Research;2023-09-05
5. A Polynomial Size Model with Implicit SWAP Gate Counting for Exact Qubit Reordering;Computational Science – ICCS 2023;2023