The following pages link to Qi Cheng (Q477182):
Displaying 50 items.
- Lower bounds of shortest vector lengths in random NTRU lattices (Q477183) (← links)
- An ideal multi-secret sharing scheme based on MSP (Q543828) (← links)
- On the ultimate complexity of factorials (Q703565) (← links)
- On the minimum gap between sums of square roots of small integers (Q719286) (← links)
- Comments on ``A linear prediction method for parameter estimation of damped sinusoids'' (Q1010213) (← links)
- Consistency of two detection techniques using single measurement of data (Q1129091) (← links)
- MNP: A class of NP optimization problems (Q1368182) (← links)
- Computing simple paths among obstacles (Q1594600) (← links)
- Kolmogorov random graphs only have trivial stable colorings. (Q1603512) (← links)
- Factor base discrete logarithms in Kummer extensions (Q1654504) (← links)
- Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes (Q1749478) (← links)
- Straight-line programs and torsion points on elliptic curves (Q1762665) (← links)
- On counting and generating curves over small finite fields (Q1827569) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- LWE from non-commutative group rings (Q2068391) (← links)
- Solution counts and sums of roots of unity (Q2161346) (← links)
- Computing zeta functions of large polynomial systems over finite fields (Q2171948) (← links)
- Efficient algorithms for sparse cyclotomic integer zero testing (Q2268346) (← links)
- Sparse univariate polynomials with many roots over finite fields (Q2363328) (← links)
- On certain computations of Pisot numbers (Q2377236) (← links)
- Partial lifting and the elliptic curve discrete logarithm problem (Q2509023) (← links)
- On the construction of finite field elements of large order (Q2566173) (← links)
- Optimally weighted ESPRIT using uniform circular arrays (Q2573960) (← links)
- Primality proving via one round in ECPP and one iteration in AKS (Q2642254) (← links)
- Asymptotic performance of optimal gain-and-phase estimators of sensor arrays (Q2734438) (← links)
- (Q2739445) (← links)
- Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
- On Determining Deep Holes of Generalized Reed-Solomon Codes (Q2872075) (← links)
- Traps to the BGJT-algorithm for discrete logarithms (Q2878837) (← links)
- Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices (Q2898025) (← links)
- (Q2935749) (← links)
- Counting Value Sets: Algorithm and Complexity (Q2949496) (← links)
- Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields (Q2963217) (← links)
- On Determining Deep Holes of Generalized Reed–Solomon Codes (Q2977046) (← links)
- A Deterministic Reduction for the Gap Minimum Distance Problem (Q2989711) (← links)
- Constructing Finite Field Extensions with Large Order Elements (Q3519204) (← links)
- Complexity of Decoding Positive-Rate Reed-Solomon Codes (Q3521927) (← links)
- Bandwidth management in distributed sequential detection (Q3546706) (← links)
- Finding the Smallest Gap between Sums of Square Roots (Q3557039) (← links)
- Combinatorial optimization problems in self-assembly (Q3579174) (← links)
- Bounding the sum of square roots via lattice reduction (Q3584821) (← links)
- Hard Problems of Algebraic Geometry Codes (Q3604740) (← links)
- Detection of cisoids using least square error function (Q4355515) (← links)
- (Q4418645) (← links)
- (Q4425948) (← links)
- (Q4472081) (← links)
- Collaborative Event-Region and Boundary-Region Detections in Wireless Sensor Networks (Q4568751) (← links)
- An MDL Algorithm for Detecting More Sources Than Sensors Using Outer-Products of Array Output (Q4579630) (← links)
- (Q4664413) (← links)
- Qualitative analysis of a degenerate fixed point of a discrete predator–prey model with cooperative hunting (Q4957859) (← links)
