An approach for proving the NP-hardness of optimization problems with hard computable objectivesYakov M. Shafransky, T-C. Edwin Cheng, C-T. Daniel NgThe first international workshop on dynamic scheduling problems（2016）引用 0|浏览0暂无评分AI 理解论文溯源树样例生成溯源树，研究论文发展脉络Chat Paper正在生成论文摘要
