location: Current position: Home >> Scientific Research >> Paper Publications

Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding

Hits:

Affiliation of Author(s):计算机科学与技术学院

First Author:刘李鑫

Indexed by:Unit Twenty Basic Research

Document Code:ABD61BA189A8432BA9A8464DBFE649B3

Volume:27

Issue:2

Page Number:200

Translation or Not:no

Date of Publication:2020-02-01

Pre One:基于FFT技术的MULTI2线性分析

Next One:Key Difference Invariant Bias in Block Ciphers