default search action
Qi Cheng 0001
Person information
- affiliation: University of Oklahoma, School of Computer Science, Norman, OK, USA
- affiliation (PhD 2001): University of Southern California, Los Angeles, CA, USA
- affiliation (1996 - 1997): University of California, Riverside, CA, USA
- affiliation (1995 - 1996): Fudan University, Shanghai, China
Other persons with the same name
- Qi Cheng — disambiguation page
- Qi Cheng 0002
— Oklahoma State University, School of Electrical and Computer Engineering, Stillwater, OK, USA (and 2 more)
- Qi Cheng 0003
- Qi Cheng 0004
- Qi Cheng 0005
- Qi Cheng 0006
- Qi Cheng 0007
- Qi Cheng 0008 — Wuhan Digital Engineering Institute, Product Engineering Department, Wuhan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j29]Qi Cheng
LWE from non-commutative group rings. Des. Codes Cryptogr. 90(1): 239-263 (2022) - [j28]Qi Cheng, J. Maurice Rojas, Daqing Wan:
Computing zeta functions of large polynomial systems over finite fields. J. Complex. 73: 101681 (2022) - 2021
- [c26]Yanbin Pan, Jun Xu, Nick Wadleigh, Qi Cheng
On the Ideal Shortest Vector Problem over Random Rational Primes. EUROCRYPT (1) 2021: 559-583 - [i21]Yanbin Pan, Jun Xu, Nick Wadleigh, Qi Cheng:
On the Ideal Shortest Vector Problem over Random Rational Primes. IACR Cryptol. ePrint Arch. 2021: 245 (2021) - 2020
- [i20]Yanbin Pan, Jun Xu, Nick Wadleigh, Qi Cheng:
On the ideal shortest vector problem over random rational primes. CoRR abs/2004.10278 (2020) - [i19]Qi Cheng, J. Maurice Rojas, Daqing Wan:
Computing zeta functions of large polynomial systems over finite fields. CoRR abs/2007.13214 (2020)
2010 – 2019
- 2019
- [j27]Dianyan Xiao, Qi Cheng:
A faster method to compute primitive elements and discrete logarithms of factor base in Artin-Schreier extensions. Sci. China Inf. Sci. 62(9): 199501:1-199501:3 (2019) - 2018
- [j26]Dianyan Xiao
Factor base discrete logarithms in Kummer extensions. Finite Fields Their Appl. 53: 205-225 (2018) - 2017
- [j25]Qi Cheng
Sparse univariate polynomials with many roots over finite fields. Finite Fields Their Appl. 46: 235-246 (2017) - [i18]Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan:
Counting Roots of Polynomials Over Prime Power Rings. CoRR abs/1711.01355 (2017) - 2016
- [j24]Jingguo Bi, Qi Cheng
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields. SIAM J. Comput. 45(4): 1433-1447 (2016) - [j23]Jincheng Zhuang, Qi Cheng
On Determining Deep Holes of Generalized Reed-Solomon Codes. IEEE Trans. Inf. Theory 62(1): 199-207 (2016) - [i17]Qi Cheng, Jincheng Zhuang:
LWE from Non-commutative Group Rings. CoRR abs/1612.06670 (2016) - [i16]Qi Cheng, Jincheng Zhuang:
LWE from Non-commutative Group Rings. IACR Cryptol. ePrint Arch. 2016: 1169 (2016) - 2015
- [c25]Jincheng Zhuang, Qi Cheng
On Generating Coset Representatives of PGL2(Fq) in PGL2(Fq2). Inscrypt 2015: 167-177 - [i15]Jincheng Zhuang, Qi Cheng:
On Generating Coset Representatives of PGL2(Fq) in PGL2(Fq2). IACR Cryptol. ePrint Arch. 2015: 764 (2015) - [i14]Dianyan Xiao, Jincheng Zhuang, Qi Cheng:
Factor Base Discrete Logarithms in Kummer Extensions. IACR Cryptol. ePrint Arch. 2015: 859 (2015) - 2014
- [j22]Qi Cheng
Traps to the BGJT-algorithm for discrete logarithms. LMS J. Comput. Math. 17(Theory): 218-229 (2014) - [j21]Jingguo Bi, Qi Cheng
Lower bounds of shortest vector lengths in random NTRU lattices. Theor. Comput. Sci. 560: 121-130 (2014) - [i13]Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan:
Sparse Univariate Polynomials with Many Roots Over Finite Fields. CoRR abs/1411.6346 (2014) - 2013
- [j20]Qi Cheng
On certain computations of Pisot numbers. Inf. Process. Lett. 113(8): 271-275 (2013) - [c24]Qi Cheng
On Determining Deep Holes of Generalized Reed-Solomon Codes. ISAAC 2013: 100-110 - [c23]Jingguo Bi, Qi Cheng, J. Maurice Rojas:
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields. ISSAC 2013: 61-68 - [i12]Qi Cheng, Jiyou Li, Jincheng Zhuang:
On Determining Deep Holes of Generalized Reed-Solomon Codes. CoRR abs/1309.3546 (2013) - [i11]Qi Cheng, Daqing Wan, Jincheng Zhuang:
Traps to the BGJT-Algorithm for Discrete Logarithms. CoRR abs/1310.5124 (2013) - [i10]Qi Cheng, Daqing Wan, Jincheng Zhuang:
Traps to the BGJT-Algorithm for Discrete Logarithms. IACR Cryptol. ePrint Arch. 2013: 673 (2013) - 2012
- [j19]Qi Cheng
A Deterministic Reduction for the Gap Minimum Distance Problem. IEEE Trans. Inf. Theory 58(11): 6935-6941 (2012) - [c22]Qi Cheng, Shuhong Gao, Daqing Wan:
Constructing high order elements through subspace polynomials. SODA 2012: 1457-1463 - [c21]Jingguo Bi, Qi Cheng
Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices. TAMC 2012: 143-155 - [i9]Jingguo Bi, Qi Cheng, J. Maurice Rojas:
Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields. CoRR abs/1204.1113 (2012) - 2011
- [j18]Qi Cheng
On the minimum gap between sums of square roots of small integers. Theor. Comput. Sci. 412(39): 5458-5465 (2011) - [i8]Qi Cheng, Joshua E. Hill, Daqing Wan:
Counting Value Sets: Algorithm and Complexity. CoRR abs/1111.1224 (2011) - [i7]Jingguo Bi, Qi Cheng:
Lower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices. IACR Cryptol. ePrint Arch. 2011: 153 (2011) - 2010
- [j17]Qi Cheng
Bounding the sum of square roots via lattice reduction. Math. Comput. 79(270): 1109-1122 (2010) - [j16]Qi Cheng
Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing. Theory Comput. Syst. 46(1): 120-142 (2010) - [j15]Qi Cheng
Complexity of decoding positive-rate primitive Reed-Solomon codes. IEEE Trans. Inf. Theory 56(10): 5217-5222 (2010) - [c20]Qi Cheng
Finding the Smallest Gap between Sums of Square Roots. LATIN 2010: 446-455
2000 – 2009
- 2009
- [c19]Qi Cheng
A deterministic reduction for the gap minimum distance problem: [extended abstract]. STOC 2009: 33-38 - [i6]Qi Cheng, Xianmeng Meng, Celi Sun, Jiazhe Chen:
Bounding the Sum of Square Roots via Lattice Reduction. CoRR abs/0905.4487 (2009) - 2008
- [j14]Qi Cheng
Hard Problems of Algebraic Geometry Codes. IEEE Trans. Inf. Theory 54(1): 402-406 (2008) - [c18]Qi Cheng
Complexity of Decoding Positive-Rate Reed-Solomon Codes. ICALP (1) 2008: 283-293 - [c17]Qi Cheng, Yu-Hsin Li:
A Number Theoretic Memory Bounded Function and Its Applications. ICYCS 2008: 2021-2025 - [i5]Qi Cheng, Daqing Wan:
Complexity of Decoding Positive-Rate Reed-Solomon Codes. CoRR abs/0802.1220 (2008) - 2007
- [j13]Qi Cheng
Primality Proving via One Round in ECPP and One Iteration in AKS. J. Cryptol. 20(3): 375-387 (2007) - [j12]Qi Cheng
On the List and Bounded Distance Decodability of Reed-Solomon Codes. SIAM J. Comput. 37(1): 195-209 (2007) - [j11]Qi Cheng
Constructing Finite Field Extensions with Large Order Elements. SIAM J. Discret. Math. 21(3): 726-730 (2007) - [c16]Qi Cheng:
Derandomization of Sparse Cyclotomic Integer Zero Testing. FOCS 2007: 74-80 - [c15]Qi Cheng, Elizabeth Murray:
On Deciding Deep Holes of Reed-Solomon Codes. TAMC 2007: 296-305 - 2006
- [j10]Qi Cheng
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. Algorithmica 46(1): 59-68 (2006) - [c14]Qi Cheng
On Comparing Sums of Square Roots of Small Integers. MFCS 2006: 250-255 - [i4]Qi Cheng:
On comparing sums of square roots of small integers. CoRR abs/cs/0603002 (2006) - 2005
- [j9]Qi Cheng
On the construction of finite field elements of large order. Finite Fields Their Appl. 11(3): 358-366 (2005) - [j8]Qi Cheng
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields. SIAM J. Comput. 34(6): 1432-1442 (2005) - [j7]Gagan Aggarwal, Qi Cheng
Complexities for Generalized Models of Self-Assembly. SIAM J. Comput. 34(6): 1493-1515 (2005) - [i3]Qi Cheng:
Hard Problems of Algebraic Geometry Codes. CoRR abs/cs/0507026 (2005) - [i2]Qi Cheng, Elizabeth Murray:
On Deciding Deep Holes of Reed-Solomon Codes. CoRR abs/cs/0509065 (2005) - 2004
- [j6]Qi Cheng
On counting and generating curves over small finite fields. J. Complex. 20(2-3): 284-296 (2004) - [j5]Qi Cheng
On the ultimate complexity of factorials. Theor. Comput. Sci. 326(1-3): 419-429 (2004) - [c13]Qi Cheng
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields. CRYPTO 2004: 201-212 - [c12]Qi Cheng, Daqing Wan:
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract). FOCS 2004: 335-341 - [c11]Qi Cheng
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. ISAAC 2004: 342-351 - [c10]Ho-Lin Chen, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, Pablo Moisset de Espanés:
Invadable self-assembly: combining robustness with efficiency. SODA 2004: 890-899 - [c9]Qi Cheng:
Constructing finite field extensions with large order elements. SODA 2004: 1130-1131 - 2003
- [j4]Qi Cheng
Straight-line programs and torsion points on elliptic curves. Comput. Complex. 12(3-4): 150-161 (2003) - [c8]Qi Cheng
Primality Proving via One Round in ECPP and One Iteration in AKS. CRYPTO 2003: 338-348 - [c7]Qi Cheng
On the Ultimate Complexity of Factorials. STACS 2003: 157-166 - 2002
- [j3]Qi Cheng
Kolmogorov random graphs only have trivial stable colorings. Inf. Process. Lett. 81(3): 133-136 (2002) - [c6]Qi Cheng
Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture. CT-RSA 2002: 290-299 - [c5]Qi Cheng
Some Remarks on the L-Conjecture. ISAAC 2002: 128-136 - [c4]Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W. K. Rothemund:
Combinatorial optimization problems in self-assembly. STOC 2002: 23-32 - [i1]Qi Cheng:
A New Class of Unsafe Primes. IACR Cryptol. ePrint Arch. 2002: 109 (2002) - 2001
- [c3]Leonard M. Adleman, Qi Cheng
Running time and program size for self-assembled squares. STOC 2001: 740-748 - 2000
- [j2]Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
Computing simple paths among obstacles. Comput. Geom. 16(4): 223-233 (2000) - [c2]Qi Cheng
Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments. ANTS 2000: 233-246
1990 – 1999
- 1997
- [j1]Qi Cheng, Hong Zhu:
MNP: A class of NP optimization problems. J. Comput. Sci. Technol. 12(4): 306-313 (1997) - 1995
- [c1]Qi Cheng, Hong Zhu:
MNP: A Class of NP Optimization Problems (Extended Abstract). COCOON 1995: 559-565
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: