共 50 条
- [1] A POLYNOMIAL-TIME ALGORITHM FOR A LARGE SUBCLASS OF THE INTEGER KNAPSACK-PROBLEM DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1984, 37 (03): : 309 - 312
- [2] Solving the 0-1 Knapsack Problem with Polynomial-Time Quantum Algorithm COMMUNICATIONS AND INFORMATION PROCESSING, PT 2, 2012, 289 : 377 - +
- [4] A polynomial-time algorithm for reducing the number of variables in MAX SAT problem SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 1997, 40 (03): : 301 - 311
- [5] A polynomial-time algorithm for reducing the number of variables in MAX SAT problem Sci China Ser E Technol Sci, 3 (x9-311):
- [6] A polynomial-time algorithm for reducing the number of variables in MAX SAT problem Science in China Series E: Technological Sciences, 1997, 40 : 301 - 311
- [9] A Polynomial-Time Algorithm for the Maximum Clique Problem 2013 IEEE/ACIS 12TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS), 2013, : 503 - 507