共 50 条
- [21] Probabilistic solutions to some NP-hard matrix problems AUTOMATICA, 2001, 37 (09) : 1397 - 1405
- [25] Computing a minimum-dilation spanning tree is NP-hard COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 41 (03): : 188 - 205
- [27] Faster exact solutions for some NP-hard problems (extended abstract) ALGORITHMS - ESA'99, 1999, 1643 : 450 - 461
- [29] An alternative proof that exact inference problem in Bayesian belief networks is NP-hard COMPUTER AND INFORMATION SCIENCES - ISCIS 2005, PROCEEDINGS, 2005, 3733 : 947 - 955
- [30] Solving NP-Hard Number Matrix Games with Wisdom of Artificial Crowds PROCEEDINGS OF CGAMES'2015 USA 20TH INTERNATIONAL CONFERENCE ON COMPUTER GAMES - AI, ANIMATION, MOBILE, INTERACTIVE MULTIMEDIA, EDUCATIONAL AND SERIOUS GAMES, 2015, : 38 - 43