Qi Cheng

From MaRDI portal
Person:477182

Available identifiers

zbMath Open cheng.qiMaRDI QIDQ477182

List of research outcomes





PublicationDate of PublicationType
Global attractor and its 1D and 2D structures of Beverton-Holt Ricker competition model2024-12-06Paper
Secure three-party quantum summation based on W-class states2024-07-10Paper
MNP: A class of NP optimization problems2023-12-12Paper
Counting roots for polynomials modulo prime powers2023-08-02Paper
Qualitative structure of a discrete predator-prey model with nonmonotonic functional response2023-06-19Paper
Computing zeta functions of large polynomial systems over finite fields2022-09-12Paper
Solution counts and sums of roots of unity2022-08-04Paper
LWE from non-commutative group rings2022-01-19Paper
On the ideal shortest vector problem over random rational primes2021-12-08Paper
Qualitative analysis of a degenerate fixed point of a discrete predator–prey model with cooperative hunting2021-09-10Paper
Lightweight noninteractive membership authentication and group key establishment for WSNs2021-05-14Paper
Flip bifurcations of two systems of difference equations2021-01-12Paper
https://portal.mardi4nfdi.de/entity/Q57434902019-05-10Paper
An MDL Algorithm for Detecting More Sources Than Sensors Using Outer-Products of Array Output2018-08-22Paper
Factor base discrete logarithms in Kummer extensions2018-08-08Paper
Collaborative Event-Region and Boundary-Region Detections in Wireless Sensor Networks2018-06-27Paper
Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes2018-05-17Paper
Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes2017-07-27Paper
An Efficient Version of the Bombieri-Vaaler Lemma2017-07-19Paper
Sparse univariate polynomials with many roots over finite fields2017-07-13Paper
A Deterministic Reduction for the Gap Minimum Distance Problem2017-06-08Paper
On Determining Deep Holes of Generalized Reed–Solomon Codes2017-04-28Paper
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields2017-02-10Paper
Sublinear root detection and new hardness results for sparse polynomials over finite fields2016-08-26Paper
On Generating Coset Representatives of $$PGL_{2}(\mathbb {F}_{q})$$ P G L 2 ( F q ) in $$PGL_{2}(\mathbb {F}_{q^{2}})$$ P G L 2 ( F q 2 )2016-07-25Paper
Counting Value Sets: Algorithm and Complexity2015-10-01Paper
https://portal.mardi4nfdi.de/entity/Q55013512015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013782015-08-03Paper
Running time and program size for self-assembled squares2015-02-27Paper
A deterministic reduction for the gap minimum distance problem2015-02-04Paper
https://portal.mardi4nfdi.de/entity/Q29357492014-12-30Paper
Lower bounds of shortest vector lengths in random NTRU lattices2014-12-02Paper
Traps to the BGJT-algorithm for discrete logarithms2014-09-05Paper
On Determining Deep Holes of Generalized Reed-Solomon Codes2014-01-14Paper
On certain computations of Pisot numbers2013-06-28Paper
Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices2012-07-16Paper
On the minimum gap between sums of square roots of small integers2011-10-10Paper
An ideal multi-secret sharing scheme based on MSP2011-06-17Paper
Bounding the sum of square roots via lattice reduction2010-08-30Paper
Combinatorial optimization problems in self-assembly2010-08-05Paper
Finding the Smallest Gap between Sums of Square Roots2010-04-27Paper
Efficient algorithms for sparse cyclotomic integer zero testing2010-03-05Paper
Comments on ``A linear prediction method for parameter estimation of damped sinusoids2009-04-03Paper
Hard Problems of Algebraic Geometry Codes2009-02-24Paper
Bandwidth management in distributed sequential detection2008-12-21Paper
Complexity of Decoding Positive-Rate Reed-Solomon Codes2008-08-28Paper
Constructing Finite Field Extensions with Large Order Elements2008-08-13Paper
On the List and Bounded Distance Decodability of Reed–Solomon Codes2008-03-28Paper
Advances in Cryptology - CRYPTO 20032007-11-28Paper
On Deciding Deep Holes of Reed-Solomon Codes2007-11-13Paper
On Comparing Sums of Square Roots of Small Integers2007-09-05Paper
Primality proving via one round in ECPP and one iteration in AKS2007-08-20Paper
Partial lifting and the elliptic curve discrete logarithm problem2006-10-16Paper
Algorithms and Computation2005-12-22Paper
Optimally weighted ESPRIT using uniform circular arrays2005-11-25Paper
On the construction of finite field elements of large order2005-09-22Paper
Complexities for Generalized Models of Self-Assembly2005-09-16Paper
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields2005-09-16Paper
Advances in Cryptology – CRYPTO 20042005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q46644132005-04-05Paper
Straight-line programs and torsion points on elliptic curves2005-02-11Paper
On the ultimate complexity of factorials2005-01-11Paper
On counting and generating curves over small finite fields2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44720812004-08-03Paper
https://portal.mardi4nfdi.de/entity/Q44259482003-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44186452003-08-11Paper
Asymptotic performance of optimal gain-and-phase estimators of sensor arrays2003-03-20Paper
Kolmogorov random graphs only have trivial stable colorings.2002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q27394452001-09-09Paper
Computing simple paths among obstacles2001-04-10Paper
Consistency of two detection techniques using single measurement of data1998-08-13Paper
Detection of cisoids using least square error function1997-12-18Paper
MNP: A class of NP optimization problems1997-09-28Paper

Research outcomes over time

This page was built for person: Qi Cheng