MNP: A Class of NP Optimization Problems (Extended Abstract). - Qi Cheng 001; Hong Zhu 004 (COCOON, 1995)

MNP: A class of NP optimization problems. - Qi Cheng 001; Hong Zhu 004 (J. Comput. Sci. Technol., 1997)

Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments. - Qi Cheng 001; Ming-Deh A. Huang (ANTS, 2000)

Computing simple paths among obstacles. - Qi Cheng 001; Marek Chrobak; Gopalakrishnan Sundaram (Comput. Geom., 2000)

Running time and program size for self-assembled squares. - Leonard M. Adleman; Qi Cheng 001; Ashish Goel; Ming-Deh A. Huang (STOC, 2001)

Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture. - Qi Cheng 001; Shigenori Uchiyama (CT-RSA, 2002)

Some Remarks on the L-Conjecture. - Qi Cheng 001 (ISAAC, 2002)

Combinatorial optimization problems in self-assembly. - Leonard M. Adleman; Qi Cheng 001; Ashish Goel; Ming-Deh A. Huang; David Kempe 001; Pablo Moisset de Espanés; Paul W. K. Rothemund (STOC, 2002)

A New Class of Unsafe Primes. - Qi Cheng 001 (IACR Cryptol. ePrint Arch., 2002)

Kolmogorov random graphs only have trivial stable colorings. - Qi Cheng 001; Fang Fang (Inf. Process. Lett., 2002)

Primality Proving via One Round in ECPP and One Iteration in AKS. - Qi Cheng 001 (CRYPTO, 2003)

On the Ultimate Complexity of Factorials. - Qi Cheng 001 (STACS, 2003)

Straight-line programs and torsion points on elliptic curves. - Qi Cheng 001 (Comput. Complex., 2003)

On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields. - Qi Cheng 001 (CRYPTO, 2004)

On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract). - Qi Cheng 001; Daqing Wan (FOCS, 2004)

On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. - Qi Cheng 001; Ming-Deh A. Huang (ISAAC, 2004)

Invadable self-assembly: combining robustness with efficiency. - Ho-Lin Chen; Qi Cheng 001; Ashish Goel; Ming-Deh A. Huang; Pablo Moisset de Espanés (SODA, 2004)

Constructing finite field extensions with large order elements. - Qi Cheng 001 (SODA, 2004)

On counting and generating curves over small finite fields. - Qi Cheng 001; Ming-Deh A. Huang (J. Complex., 2004)

On the construction of finite field elements of large order. - Qi Cheng 001 (Finite Fields Their Appl., 2005)

Complexities for Generalized Models of Self-Assembly. - Gagan Aggarwal; Qi Cheng 001; Michael H. Goldwasser; Ming-Yang Kao; Pablo Moisset de Espanés; Robert T. Schweller (SIAM J. Comput., 2005)

On Comparing Sums of Square Roots of Small Integers. - Qi Cheng 001 (MFCS, 2006)

Derandomization of Sparse Cyclotomic Integer Zero Testing. - Qi Cheng 001 (FOCS, 2007)

On Deciding Deep Holes of Reed-Solomon Codes. - Qi Cheng 001; Elizabeth Murray (TAMC, 2007)

On the List and Bounded Distance Decodability of Reed-Solomon Codes. - Qi Cheng 001; Daqing Wan (SIAM J. Comput., 2007)

Complexity of Decoding Positive-Rate Reed-Solomon Codes. - Qi Cheng 001; Daqing Wan (ICALP (1), 2008)

A Number Theoretic Memory Bounded Function and Its Applications. - Qi Cheng 001; Yu-Hsin Li (ICYCS, 2008)

Hard Problems of Algebraic Geometry Codes. - Qi Cheng 001 (IEEE Trans. Inf. Theory, 2008)

A deterministic reduction for the gap minimum distance problem: [extended abstract]. - Qi Cheng 001; Daqing Wan (STOC, 2009)

Finding the Smallest Gap between Sums of Square Roots. - Qi Cheng 001; Yu-Hsin Li (LATIN, 2010)

Bounding the sum of square roots via lattice reduction. - Qi Cheng 001; Xianmeng Meng; Celi Sun; Jiazhe Chen (Math. Comput., 2010)

Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing. - Qi Cheng 001; Sergey P. Tarasov; Mikhail N. Vyalyi (Theory Comput. Syst., 2010)

Complexity of decoding positive-rate primitive Reed-Solomon codes. - Qi Cheng 001; Daqing Wan (IEEE Trans. Inf. Theory, 2010)

Counting Value Sets: Algorithm and Complexity - Qi Cheng 001; Joshua E. Hill; Daqing Wan (CoRR, 2011)

Lower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices. - Jingguo Bi; Qi Cheng 001 (IACR Cryptol. ePrint Arch., 2011)

On the minimum gap between sums of square roots of small integers. - Qi Cheng 001; Yu-Hsin Li (Theor. Comput. Sci., 2011)

Constructing high order elements through subspace polynomials. - Qi Cheng 001; Shuhong Gao; Daqing Wan (SODA, 2012)

Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices. - Jingguo Bi; Qi Cheng 001 (TAMC, 2012)

A Deterministic Reduction for the Gap Minimum Distance Problem. - Qi Cheng 001; Daqing Wan (IEEE Trans. Inf. Theory, 2012)

On Determining Deep Holes of Generalized Reed-Solomon Codes. - Qi Cheng 001; Jiyou Li; Jincheng Zhuang (ISAAC, 2013)

Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields. - Jingguo Bi; Qi Cheng 001; J. Maurice Rojas (ISSAC, 2013)

On certain computations of Pisot numbers. - Qi Cheng 001; Jincheng Zhuang (Inf. Process. Lett., 2013)

Traps to the BGJT-algorithm for discrete logarithms. - Qi Cheng 001; Daqing Wan; Jincheng Zhuang (LMS J. Comput. Math., 2014)

On Generating Coset Representatives of PGL2(Fq) in PGL2(Fq2). - Jincheng Zhuang; Qi Cheng 001 (Inscrypt, 2015)

On Generating Coset Representatives of PGL2(Fq) in PGL2(Fq2). - Jincheng Zhuang; Qi Cheng 001 (IACR Cryptol. ePrint Arch., 2015)

LWE from Non-commutative Group Rings. - Qi Cheng 001; Jincheng Zhuang (IACR Cryptol. ePrint Arch., 2016)

Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields. - Jingguo Bi; Qi Cheng 001; J. Maurice Rojas (SIAM J. Comput., 2016)

Counting Roots of Polynomials Over Prime Power Rings. - Qi Cheng 001; Shuhong Gao; J. Maurice Rojas; Daqing Wan (CoRR, 2017)

Sparse univariate polynomials with many roots over finite fields. - Qi Cheng 001; Shuhong Gao; J. Maurice Rojas; Daqing Wan (Finite Fields Their Appl., 2017)

Factor base discrete logarithms in Kummer extensions. - Dianyan Xiao; Jincheng Zhuang; Qi Cheng 001 (Finite Fields Their Appl., 2018)

A faster method to compute primitive elements and discrete logarithms of factor base in Artin-Schreier extensions. - Dianyan Xiao; Qi Cheng 001 (Sci. China Inf. Sci., 2019)

On the Ideal Shortest Vector Problem over Random Rational Primes. - Yanbin Pan; Jun Xu 022; Nick Wadleigh; Qi Cheng 001 (EUROCRYPT (1), 2021)

LWE from non-commutative group rings. - Qi Cheng 001; Jun Zhang 031; Jincheng Zhuang (Des. Codes Cryptogr., 2022)

Computing zeta functions of large polynomial systems over finite fields. - Qi Cheng 001; J. Maurice Rojas; Daqing Wan (J. Complex., 2022)