• Search: "sparse polynomials"

Showing 1 - 20 of 266

1

Certificates of nonnegativity of multivariate polynomials with zero-dimensional gradient ideal and infimum attained
Bender, Matías ; Tsigaridas, Elias ; Zhu, Chaoping ; et al.

certificate of positivit... SOS rational univariate repr... sparse polynomials Newton polytope bit complexity …
Electronic Resource
Save to List
2

Fast polynomial computations with space constraints
Calculs polynomiaux rapides avec contraintes de mémoire
Grenet, Bruno ; Calcul Algébrique et Symbolique, Sécurité, Systèmes Complexes, Codes et Cryptologie (CASC) ; Laboratoire Jean Kuntzmann (LJK) ; et al.
Symbolic Computation [cs.SC]. Université Grenoble Alpes, 2025

sparse polynomials space complexity algorithms on polynomial... polynômes creux complexité en espace algorithmes sur les poly... …
Report
Save to List
3

Derandomization via Symmetric Polytopes: Poly-time Factorization of Certain Sparse Polynomials
Pranav Bisht ; Nitin Saxena ; Pranav Bisht and Nitin Saxena
ACM Transactions on Computation Theory. 17:1-20

symmetric polynomials Multivariate polynomial... convex polytopes factor-sparsity sparse polynomials ddc:004 …
Academic journal
Save to List
4

Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces
Tonelli-Cueto, Josué ; Tsigaridas, Elias ; OUtils de Résolution Algébriques pour la Géométrie et ses ApplicatioNs (OURAGAN) ; et al.
Proceedings of the 2020 International Symposium on Symbolic and Algebraic Computation. :434-441

Kalamata, Greece Probabilistic complexity Subdivision methods Sparse polynomials Condition number Numerical algebraic geom... …
Conference
Save to List
5

On the Number of Real Zeros of Random Sparse Polynomial Systems
Ergür, Alperen A. ; Telek, Máté L. ; Tonelli-Cueto, Josué ; et al.

real zeros fewnomials sparse polynomials random real algebraic 14P05, 60D05 [MATH.MATH-AG]Mathematic... …
Electronic Resource
Save to List
6

On Solving Sparse Polynomial Factorization Related Problems
Bisht, Pranav ; Volkovich, Ilya ; Pranav Bisht and Ilya Volkovich
computational complexity. 34

Identity Testing Multivariate Polynomial... Sparse Polynomials Factor-Sparsity Derandomization ddc:004
Academic journal
Save to List
7

Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces
Tonelli-Cueto, Josué ; Tsigaridas, Elias ; OUtils de Résolution Algébriques pour la Géométrie et ses ApplicatioNs (OURAGAN) ; et al.
Journal of Symbolic Computation. :142-173

Condition number Numerical algebraic geom... Probabilistic complexity Subdivision methods Sparse polynomials [MATH.MATH-NA]Mathematic... …
Journal
Save to List
8

Zeros of random Müntz polynomials
Lubinsky, Doron S. ; Pritsker, Igor E.
In Journal of Mathematical Analysis and Applications 15 December 2025 552(2)

Academic journal
Save to List
9

Absolute concentration robustness and multistationarity in reaction networks: Conditions for coexistence
Nidhi Kaihnsa ; Tung Nguyen ; Anne Shiu
European Journal of Applied Mathematics, Pp 1-35
Kaihnsa, N, Nguyen, T & Shiu, A 2024, ' Absolute concentration robustness and multistationarity in reaction networks : Conditions for coexistence ', European Journal of Applied Mathematics, vol. 35, no. 4, pp. 566–600 . https://doi.org/10.1017/S0956792523000335

0301 basic medicine 0303 health sciences absolute concentration r... Molecular Networks (q-bi... reaction networks 92E20 …
Academic journal
Save to List
10

Root Separation for Trinomials
Koiran, Pascal ; Laboratoire de l'Informatique du Parallélisme (LIP) ; École normale supérieure de Lyon (ENS de Lyon) ; et al.
Journal of Symbolic Computation. 95:151-161

sparse polynomials root separation root isolation [INFO.INFO-SC]Computer S... Symbolic Computation [cs... [INFO.INFO-CC]Computer S... …
Journal
Save to List
11

Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
Nagasaka, Kosaku
In Journal of Symbolic Computation March-April 2025 127

Academic journal
Save to List
12

HERMITE INTERPOLATION WITH DICKSON POLYNOMIALS AND BERNSTEIN BASIS POLYNOMIALS
Erdal İMAMOĞLU
Volume: 11, Issue: 2 158-166
Eskişehir Teknik Üniversitesi Bilim ve Teknoloji Dergisi B-Teorik Bilimler

Algebra and Number Theor... Hermite Interpolation Sparse Polynomials Dickson Polynomials Bernstein Basis Polynomi... Algorithms …
Academic journal
Save to List
13

Zero testing and equation solving for sparse polynomials on rectangular domains
Aichinger, Erhard ; Grünbacher, Simon ; Hametner, Paul
In Finite Fields and Their Applications March 2024 95

Academic journal
Save to List
14

NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
Baraskar, Omkar ; Dewan, Agrim ; Saha, Chandan ; et al.

FOS: Computer and inform... Computer Science - Compu... 3SAT Equivalence testing MCSP sparse polynomials …
Academic journal
Save to List
15

Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals
Bläser, Markus ; Engels, Christian ; FR Informatik ; et al.
Symposium on Theoretical Aspects of Computer Science (STACS2011). :555-566

Dortmund, Germany Descartes' rule of signs polynomial identity test... sparse polynomials black box testing [INFO.INFO-CC]Computer S... …
Conference
Save to List
16

On the expected number of real roots of polynomials and exponential sums
Malajovich, Gregorio
In Journal of Complexity June 2023 76

Academic journal
Save to List
17

Polynomial modular product verification and its implications
Giorgi, Pascal ; Grenet, Bruno ; Perret du Cray, Armelle
In Journal of Symbolic Computation May-June 2023 116:98-129

Academic journal
Save to List
18

Sparse polynomial interpolation based on derivatives
Huang, Qiao-Long
In Journal of Symbolic Computation January-February 2023 114:359-375

Academic journal
Save to List
19

Schinzel's Conjecture and algorithms for sparse polynomials
Conjecture de Schinzel et algorithmique des polynômes lacunaires
Andriamandratomanana, Njaka Harilala ; Laboratoire de Mathématiques Nicolas Oresme (LMNO) ; Université de Caen Normandie (UNICAEN) ; et al.
Géométrie algébrique [math.AG]. Normandie Université, 2023. Français. ⟨NNT : 2023NORMC212⟩

Diophantine geometry Sparse polynomials Explicit bound GCD Algorithms Géométrie diophantienne... …
Dissertation/ Thesis
Save to List
20

ON THE EVALUATION OF SOME SPARSE POLYNOMIALS
NOGNENG, DORIAN ; SCHOST, ÉRIC
Mathematics of Computation, 2018 Mar 01. 87(310), 893-904.

Academic journal
Save to List
Search Tools: Get RSS Feed Email this Search Save Search

Filter