Imagen de Portada

A New Bound on Cofactors of Sparse Polynomials

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nahshon, Ido, Shpilka, Amir
Formato:	Preprint
Publicado:	2023
Materias:	Symbolic Computation Computational Complexity Number Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Factorization of Sparse Polynomials of Bounded Individual Degree
por: Chuyoon, Aminadav, et al.
Publicado: (2026)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
por: Dwivedi, Ashish, et al.
Publicado: (2024)

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
por: Vu, Thi Xuan
Publicado: (2025)

Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
por: Bournez, Olivier, et al.
Publicado: (2026)

Algorithms for computing norms and characteristic polynomials on general Drinfeld modules
por: Caruso, Xavier, et al.
Publicado: (2023)

Algorithms for Algebraic and Arithmetic Attributes of Hypergeometric Functions
por: Caruso, Xavier, et al.
Publicado: (2026)

Computing Euler products and coefficients of classical modular forms for twisted L-functions
por: Molin, Pascal
Publicado: (2025)

Algebraic and Arithmetic Attributes of Hypergeometric Functions in SageMath
por: Caruso, Xavier, et al.
Publicado: (2026)

On the integrality of some P-recursive sequences
por: Matveeva, Anastasia
Publicado: (2025)

Computing basis of solutions of any Mahler equation
por: Faverjon, Colin, et al.
Publicado: (2025)

Hahn series and Mahler equations: Algorithmic aspects
por: Faverjon, C., et al.
Publicado: (2024)

An algorithm to recognize regular singular Mahler systems
por: Faverjon, Colin, et al.
Publicado: (2021)

Regular singular Mahler equations and Newton polygons
por: Faverjon, Colin, et al.
Publicado: (2025)

Diagonals and algebraicity modulo $p$: a sharper degree bound
por: Adamczewski, Boris, et al.
Publicado: (2026)

Computing change of level and isogenies between abelian varieties
por: Dequay, Antoine, et al.
Publicado: (2025)

Computation of classical and $v$-adic $L$-series of $t$-motives
por: Caruso, Xavier, et al.
Publicado: (2024)

Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals
por: Garg, Abhibhav, et al.
Publicado: (2025)

Modular composition & polynomial GCD in the border of small, shallow circuits
por: Andrews, Robert, et al.
Publicado: (2025)

Hilbert's Nullstellensatz is in the Counting Hierarchy
por: Andrews, Robert, et al.
Publicado: (2026)

Fast interpolation and multiplication of unbalanced polynomials
por: Giorgi, Pascal, et al.
Publicado: (2024)

Constant-Depth Arithmetic Circuits for Linear Algebra Problems
por: Andrews, Robert, et al.
Publicado: (2024)

Matrices with displacement structure: a deterministic approach for linear systems and nullspace bases
por: Khichane, Sara, et al.
Publicado: (2026)

Fast polynomial computations with space constraints
por: Grenet, Bruno
Publicado: (2025)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
por: Yamakami, Tomoyuki
Publicado: (2024)

Quantifier Elimination Meets Treewidth
por: Wu, Hao, et al.
Publicado: (2026)

A quasi-optimal lower bound for skew polynomial multiplication
por: Chen, Qiyuan, et al.
Publicado: (2024)

On the complexity of Chow and Hurwitz forms
por: Doğan, Mahmut Levent, et al.
Publicado: (2022)

Extrapolating Solution Paths of Polynomial Homotopies towards Singularities with PHCpack and phcpy
por: Verschelde, Jan, et al.
Publicado: (2024)

First-order factors of linear Mahler operators
por: Chyzak, Frédéric, et al.
Publicado: (2024)

Computing a Group Action from the Class Field Theory of Imaginary Hyperelliptic Function Fields
por: Leudière, Antoine, et al.
Publicado: (2022)

Some explicit arithmetic on curves of genus three and their applications
por: Moriya, Tomoki, et al.
Publicado: (2022)

Gr{ö}bner bases over polytopal affinoid algebras
por: Barkatou, Moulay A., et al.
Publicado: (2024)

Computing Isomorphisms between Products of Supersingular Elliptic Curves
por: Gaudry, Pierrick, et al.
Publicado: (2025)

Factoring Linear Differential Operators in Positive Characteristic by means of Solving a Norm Equation
por: Pagès, Raphaël
Publicado: (2024)

Explicit cost analysis of Toom-4 multiplication for incomplete NTT in lattice-based cryptography
por: Oku, Sakura, et al.
Publicado: (2026)

Universal Analytic Gr{ö}bner Bases and Tropical Geometry
por: Vaccon, Tristan, et al.
Publicado: (2024)

The complexity of class polynomial computation via floating point approximations
por: Enge, Andreas
Publicado: (2006)

Polynomial Identity Testing and Reconstruction for Depth-4 Powering Circuits of High Degree
por: Shpilka, Amir, et al.
Publicado: (2026)

Identity Testing for Radical Expressions
por: Balaji, Nikhil, et al.
Publicado: (2022)

Runtime Repeated Recursion Unfolding in CHR: A Just-In-Time Online Program Optimization Strategy That Can Achieve Super-Linear Speedup
por: Fruehwirth, Thom
Publicado: (2023)