共 50 条
- [34] Reordering Decision Diagrams for Quantum Computing Is Harder Than You Might Think REVERSIBLE COMPUTATION, 2022, : 93 - 107
- [39] Lempel-Ziv Factorization May Be Harder Than Computing All Runs 32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 582 - 593