Old Web
English
Sign In
Acemap
>
Paper
>
An approach for proving the NP-hardness of optimization problems with hard computable objectives
An approach for proving the NP-hardness of optimization problems with hard computable objectives
2016
Yakov M. Shafransky
T.C. Edwin Cheng
C.T. Daniel Ng
Keywords:
Computer science
Mathematical optimization
Optimization problem
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]