Rojas, J. Maurice
157  Ergebnisse:
Personensuche X
?
1

Feasibility of Circuit Polynomials without Purple Swans: Fe..:

, In: Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation,
Deng, Weixun ; Ergur, Alperen ; Paouris, Grigoris. - p. 429-436 , 2024
 
?
2

Quickly Computing Isotopy Type for Exponential Sums over Ci..:

Bihan, Frédéric ; Croy, Erika ; Deng, Weixun...
ACM Communications in Computer Algebra.  57 (2023)  3 - p. 152-155 , 2023
 
?
 
?
7

A Complexity Chasm for Solving Univariate Sparse Polynomial..:

, In: Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation,
Rojas, J. Maurice ; Zhu, Yuyu - p. 337-344 , 2021
 
?
8

A complexity chasm for solving sparse polynomial equations ..:

Rojas, J. Maurice ; Zhu, Yuyu
ACM Communications in Computer Algebra.  54 (2021)  3 - p. 86-90 , 2021
 
?
9

A complexity chasm for solving sparse polynomial equations ..:

Rojas, J. Maurice ; Zhu, Yuyu
ACM Communications in Computer Algebra.  54 (2020)  3 - p. 86-90 , 2020
 
?
10

A Faster Solution to Smale's 17th Problem I : Real Binom..:

, In: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation,
 
?
 
?
13

Probabilistic Condition Number Estimates for Real Polynomia..:

Ergür, Alperen A. ; Paouris, Grigoris ; Rojas, J. Maurice
Foundations of Computational Mathematics.  19 (2018)  1 - p. 131-157 , 2018
 
?
14

Sparse univariate polynomials with many roots over finite f..:

Cheng, Qi ; Gao, Shuhong ; Maurice Rojas, J..
Finite Fields and Their Applications.  46 (2017)  - p. 235-246 , 2017
 
?
 
1-15