Funder
U.S. Department of Energy
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Modeling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials
Reference31 articles.
1. Aloise, D., Amit, D., Hansen, P., et al.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. (2009). https://doi.org/10.1007/s10994-009-5103-0
2. Blum, A., Rivest, R.L.: Training a 3-node neural network is NP-complete. In: Proceedings of the First Annual Workshop on Computational Learning Theory, pp. 9–18. Morgan Kaufmann Publishers Inc., Cambridge (1988). https://doi.org/10.1016/S0893-6080(05)80010-3
3. Hyafil, L., Rivest, R.: Constructing optimal binary decision trees is NP-complete. Inf. Process. Lett. (1976). https://doi.org/10.1016/0020-0190(76)90095-8
4. Willsch, D., Willsch, M., De Raedt, H., et al.: Support vector machines on the D-Wave quantum annealer. Comput. Phys. Commun. (2020). https://doi.org/10.1016/j.cpc.2019.107006
5. Dixit, V., Selvarajan, R., Alam, M.A., et al.: Training and classification using a restricted Boltzmann machine on the D-Wave 2000Q (2020). arXiv: 2005.03247
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献