Refined bit complexity for the computation of at least onepoint per connected component of a smooth completeintersection real algebraic set
Fuente:
arXiv
Guardado en:
| Autores principales: | Elliott, Jesse, Giesbrecht, Mark, Gillot, Edern, Din, Mohab Safey El, Schost, Éric |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I
por: Berthomieu, Jérémy, et al.
Publicado: (2026)
por: Berthomieu, Jérémy, et al.
Publicado: (2026)
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity
por: Prébet, Rémi, et al.
Publicado: (2024)
por: Prébet, Rémi, et al.
Publicado: (2024)
Computing the connected components of real algebraic curves
por: Rocchi, Elisabetta, et al.
Publicado: (2026)
por: Rocchi, Elisabetta, et al.
Publicado: (2026)
Solving parameter-dependent semi-algebraic systems
por: Gaillard, Louis, et al.
Publicado: (2024)
por: Gaillard, Louis, et al.
Publicado: (2024)
On Exact Reznick, Hilbert-Artin and Putinar's Representations
por: Magron, Victor, et al.
Publicado: (2018)
por: Magron, Victor, et al.
Publicado: (2018)
Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations
por: Gopalakrishnan, Sriram, et al.
Publicado: (2024)
por: Gopalakrishnan, Sriram, et al.
Publicado: (2024)
Probabilistic algorithm for computing all local minimizers of Morse functions on a compact domain
por: Din, Mohab Safey El, et al.
Publicado: (2025)
por: Din, Mohab Safey El, et al.
Publicado: (2025)
A complexity analysis of the F4 Gröbner basis algorithm with tracer data
por: Kouba, Robin, et al.
Publicado: (2026)
por: Kouba, Robin, et al.
Publicado: (2026)
Solving generic parametric linear matrix inequalities
por: Naldi, Simone, et al.
Publicado: (2025)
por: Naldi, Simone, et al.
Publicado: (2025)
Faster modular composition using two relation matrices
por: Neiger, Vincent, et al.
Publicado: (2026)
por: Neiger, Vincent, et al.
Publicado: (2026)
Hilbert's Nullstellensatz is in the Counting Hierarchy
por: Andrews, Robert, et al.
Publicado: (2026)
por: Andrews, Robert, et al.
Publicado: (2026)
A SageMath Package for Analytic Combinatorics in Several Variables: Beyond the Smooth Case
por: Hackl, Benjamin, et al.
Publicado: (2025)
por: Hackl, Benjamin, et al.
Publicado: (2025)
On the arithmetic complexity of computing Gröbner bases of comaximal determinantal ideals
por: Gopalakrishnan, Sriram
Publicado: (2024)
por: Gopalakrishnan, Sriram
Publicado: (2024)
Clifford algebra in R
por: Hankin, Robin K. S.
Publicado: (2022)
por: Hankin, Robin K. S.
Publicado: (2022)
On the computation of Gröbner bases for matrix-weighted homogeneous systems
por: Verron, Thibaut
Publicado: (2022)
por: Verron, Thibaut
Publicado: (2022)
On Parametric Linear System Solving
por: Corless, Robert M., et al.
Publicado: (2025)
por: Corless, Robert M., et al.
Publicado: (2025)
Levelwise construction of a single cylindrical algebraic cell
por: Nalbach, Jasper, et al.
Publicado: (2022)
por: Nalbach, Jasper, et al.
Publicado: (2022)
THOI: An efficient and accessible library for computing higher-order interactions enhanced by batch-processing
por: Belloli, Laouen, et al.
Publicado: (2025)
por: Belloli, Laouen, et al.
Publicado: (2025)
The complexity of class polynomial computation via floating point approximations
por: Enge, Andreas
Publicado: (2006)
por: Enge, Andreas
Publicado: (2006)
Lyn H. Lofland: Exemplary Symbolic Interactionist
por: Eric O. Silva
Publicado: (2024)
por: Eric O. Silva
Publicado: (2024)
Symbolic modeling of the Pareto-Optimal sets of two unity gain cells
por: Said Polanco-Martagón
Publicado: (2016)
por: Said Polanco-Martagón
Publicado: (2016)
A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications
por: Dumas, Jean-Guillaume, et al.
Publicado: (2025)
por: Dumas, Jean-Guillaume, et al.
Publicado: (2025)
Persistent components in Canny's Generalized Characteristic Polynomial
por: Pogudin, Gleb
Publicado: (2024)
por: Pogudin, Gleb
Publicado: (2024)
Field theory with the Maxima computer algebra system
por: Toth, Viktor T.
Publicado: (2023)
por: Toth, Viktor T.
Publicado: (2023)
Monomial-agnostic computation of vanishing ideals
por: Kera, Hiroshi, et al.
Publicado: (2021)
por: Kera, Hiroshi, et al.
Publicado: (2021)
Fast polynomial computations with space constraints
por: Grenet, Bruno
Publicado: (2025)
por: Grenet, Bruno
Publicado: (2025)
Validated numerics for algebraic path tracking
por: Guillemot, Alexandre, et al.
Publicado: (2024)
por: Guillemot, Alexandre, et al.
Publicado: (2024)
Algorithms for computing norms and characteristic polynomials on general Drinfeld modules
por: Caruso, Xavier, et al.
Publicado: (2023)
por: Caruso, Xavier, et al.
Publicado: (2023)
Diagonals and algebraicity modulo $p$: a sharper degree bound
por: Adamczewski, Boris, et al.
Publicado: (2026)
por: Adamczewski, Boris, et al.
Publicado: (2026)
Indicial polynomials and $b$-functions of $D$-modules along arbitrary varieties and their computation
por: Oaku, Toshinori
Publicado: (2026)
por: Oaku, Toshinori
Publicado: (2026)
Algebraic power series and their automatic complexity modulo prime powers
por: Rowland, Eric, et al.
Publicado: (2024)
por: Rowland, Eric, et al.
Publicado: (2024)
Constructing Koszul filtrations: existence and non-existence for G-quadratic algebras
por: Berghofer, Emily, et al.
Publicado: (2026)
por: Berghofer, Emily, et al.
Publicado: (2026)
Specializing anti-unification for interaction models composition via gate connections
por: Nguetoum, Joel, et al.
Publicado: (2025)
por: Nguetoum, Joel, et al.
Publicado: (2025)
Alienation Techniques in VayalaVasudevan Pillai’s Vishwadarshanam
por: Reshma V.R.
Publicado: (2018)
por: Reshma V.R.
Publicado: (2018)
On the complexity of Chow and Hurwitz forms
por: Doğan, Mahmut Levent, et al.
Publicado: (2022)
por: Doğan, Mahmut Levent, et al.
Publicado: (2022)
Sufficient set of integrability conditions of an orthonomic system
por: Marvan, M.
Publicado: (2006)
por: Marvan, M.
Publicado: (2006)
Faster multivariate integration in D-modules
por: Brochet, Hadrien, et al.
Publicado: (2025)
por: Brochet, Hadrien, et al.
Publicado: (2025)
How to generate all possible rational Wilf-Zeilberger forms?
por: Chen, Shaoshi, et al.
Publicado: (2024)
por: Chen, Shaoshi, et al.
Publicado: (2024)
Algorithmic Detection of Jacobi Stability for Systems of Second Order Differential Equations
por: Böhmer, Christian G., et al.
Publicado: (2025)
por: Böhmer, Christian G., et al.
Publicado: (2025)
Consequences of the Moosbauer-Poole Algorithms
por: Kauers, Manuel, et al.
Publicado: (2025)
por: Kauers, Manuel, et al.
Publicado: (2025)
Ejemplares similares
-
Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I
por: Berthomieu, Jérémy, et al.
Publicado: (2026) -
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity
por: Prébet, Rémi, et al.
Publicado: (2024) -
Computing the connected components of real algebraic curves
por: Rocchi, Elisabetta, et al.
Publicado: (2026) -
Solving parameter-dependent semi-algebraic systems
por: Gaillard, Louis, et al.
Publicado: (2024) -
On Exact Reznick, Hilbert-Artin and Putinar's Representations
por: Magron, Victor, et al.
Publicado: (2018)