- Complexity of Decoding Positive-Rate Primitive Reed-Solomon Codes
- On counting and generating curves over small finite fields
- Finding the smallest gap between sums of square and Yu-Hsin Li1
- Derandomization of Sparse Cyclotomic Integer Zero Testing School of Computer Science
- Hard Problems of Algebraic Geometry Codes Abstract--The minimum distance is one of the most
- Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing
- The Decisional Diffie-Hellman Problem and the Uniform Boundedness Theorem
- CS 5973 CRYPTOGRAPHY SPRING 2002
- Curriculum Vitae School of Computer Science Email: qcheng@ou.edu
- Curriculum Vitae RESEARCH INTERESTS
- Bounding the Sum of Square Roots via Lattice and Xianmeng Meng2
- PRIMALITY PROVING VIA ONE ROUND IN ECPP AND ONE ITERATION IN AKS
- On the Ultimate Complexity of Factorials School of Computer Science, the University of Oklahoma, Norman, OK 73019,
- Computational Geometry 16 (2000) 223233 Computing simple paths among obstacles
- Running Time and Program Size for Self-assembled Leonard Adleman Qi Chengy Ashish Goelz Ming-Deh Huangx
- Constructing finite field extensions with large order elements In this paper, we present an algorithm that given a fixed prime power q and a positive
- A New Special-Purpose Factorization Algorithm In this paper, a new factorization algorithm is presented, which finds a prime
- A Deterministic Reduction for the Gap Minimum Distance [Extended Abstract]
- Combinatorial Optimization Problems in Self-Assembly Leonard Adleman
- On comparing sums of square roots of small integers Let k and n be positive integers, n > k. Define r(n, k) to be the minimum positive value
- On Deciding Deep Holes of Reed-Solomon Codes Qi Cheng and Elizabeth Murray
- On the List and Bounded Distance Decodability of Reed-Solomon Codes
- On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
- Straight Line Programs and Torsion Points on Elliptic Curves In this paper, we show several connections between the L-conjecture, proposed by Burgisser
- On the minimum gap between sums of square roots of small integers $
- Constructing high order elements through subspace polynomials
