Hits:
Affiliation of Author(s):计算机科学与技术学院
Journal:INFORMATION AND COMPUTATION
First Author:姜海涛
Document Code:E790CF623DB0416B87F191247DBBF578
Volume:275
Number of Words:12
Translation or Not:no
Date of Publication:2020-12-01
Pre One:Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding
Next One:Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding
