Author:
Nagao Atsuki,Seto Kazuhisa,Teruyama Junichi
Funder
Ministry of Education, Culture, Sports, Science, and Technology
Japan Society for the Promotion of Science
Japan Science and Technology Agency
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. Arvind, V., Schuler, R.: The quantum query complexity of 0–1 knapsack and associated claw problems. In: Proceedings of the 14th International Symposium on Algorithms and Computation (ISAAC), pp. 168–177 (2003)
2. Barrington, D.A.M.: Bounded-width polynomial-size branching programs recognize exactly those languages in nc$${^1}$$. J. Comput. Syst. Sci. 38(1), 150–164 (1989)
3. Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: SPIRE, pp. 39–48 (2000)
4. Bollig, B., Sauerhoff, M., Sieling, D., Wegener, I.: On the power of different types of restricted branching programs. In: Electronic Colloquium on Computational Complexity (ECCC), TR94-026 (1994)
5. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35(8), 677–691 (1986)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献