Computational Complexity of Advising
暂无分享,去创建一个
This chapter formulates the problem of constructing an optimal advisor: finding both the estimator coefficients and advisor set that give the highest average advising accuracy. Earlier chapters have indicated that both the tasks of independently finding optimal estimator coefficients and optimal advisor sets are NP-complete; the problem of finding both simultaneously is NP-complete as well. This chapter gives NP-completeness proofs for the three problems of Optimal Advisor, Advisor Estimator, and Advisor Set.
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] John D. Kececioglu,et al. Learning Parameter-Advising Sets for Multiple Sequence Alignment , 2017, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[3] John D. Kececioglu,et al. Learning parameter sets for alignment advising , 2014, BCB.