Výsledky vyhľadávania - complexity. 68W30 Symbolic computation and algebraic computation

Decision problem for a class of univariate Pfaffian functions Autor Barbagallo, María Laura, Jeronimo, Gabriela, Sabia, Juan

“… We present a new symbolic procedure solving this problem with a computable complexity based on the computation of suitable Sturm sequences…”
Získať plný text

A quasi-linear irreducibility test in K[[x]][y] Autor Poteaux, Adrien, Weimann, Martin

“…We provide an irreducibility test in the ring K [ [ x ] ] [ y ] whose complexity is quasi-linear with respect to the discriminant valuation, assuming the input…”
Získať plný text

Schur Polynomials Do Not Have Small Formulas If the Determinant does not Autor Chaugule, Prasad, Kumar, Mrinal, Limaye, Nutan, Mohapatra, Chandra Kanta, She, Adrian, Srinivasan, Srikanth

“…). In recent years, they have also shown up in various incarnations in Computer Science, e.g, quantum computation Hallgren et al. (2000); O'Donnell & Wright (2015…”
Získať plný text

Computing roadmaps in unbounded smooth real algebraic sets II: Algorithm and complexity Autor Prébet, Rémi, Safey El Din, Mohab, Schost, Éric

“…A roadmap for an algebraic set V defined by polynomials with coefficients in the field Q of rational numbers is an algebraic curve contained in V whose intersection with all connected components of V∩Rn is connected…”
Získať plný text

Bounds for Polynomials on Algebraic Numbers and Application to Curve Topology Autor Diatta, Daouda Niang, Diatta, Sény, Rouillier, Fabrice, Roy, Marie-Françoise, Sagraloff, Michael

“… } be the real planar algebraic curve implicitly defined as the vanishing set of  P . We give a deterministic algorithm to compute the topology of V R ( P…”
Získať plný text

Using Machine Learning to Improve Cylindrical Algebraic Decomposition Autor Huang, Zongyan, England, Matthew, Wilson, David J., Bridge, James, Davenport, James H., Paulson, Lawrence C.

“…Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, best known as a procedure to enable Quantifier Elimination over real-closed fields…”
Získať plný text

Algebraic diagonals and walks: Algorithms, bounds, complexity Autor Bostan, Alin, Dumont, Louis, Salvy, Bruno

“… It is classical that in this case DiagF is an algebraic function. We propose an algorithm that computes an annihilating polynomial for DiagF…”
Získať plný text

Algorithmic Reduction of Biological Networks with Multiple Time Scales Autor Kruff, Niclas, Lüders, Christoph, Radulescu, Ovidiu, Sturm, Thomas, Walcher, Sebastian

“…We present a symbolic algorithmic approach that allows to compute invariant manifolds and corresponding reduced systems for differential equations modeling biological networks which comprise chemical…”
Získať plný text

Real root finding for low rank linear matrices Autor Henrion, Didier, Naldi, Simone, Din, Mohab Safey El

“… that intersects each connected component of the low rank real algebraic set. The complexity of our algorithm is studied thoroughly…”
Získať plný text

Dimension results for extremal-generic polynomial systems over complete toric varieties Autor Bender, Matías, Spaenlehauer, Pierre-Jean

“…We study polynomial systems with prescribed monomial supports in the Cox ring of a toric variety built from a complete polyhedral fan. We present combinatorial…”
Získať plný text

A Logic Based Approach to Finding Real Singularities of Implicit Ordinary Differential Equations Autor Seiler, Werner M., Seiß, Matthias, Sturm, Thomas

“…We discuss the effective computation of geometric singularities of implicit ordinary differential equations over the real numbers using methods from logic…”
Získať plný text

Computing the equisingularity type of a pseudo-irreducible polynomial Autor Poteaux, Adrien, Weimann, Martin

“…Germs of plane curve singularities can be classified accordingly to their equisingularity type. For singularities over C , this important data coincides with…”
Získať plný text

On the complexity of skew arithmetic Autor van der Hoeven, Joris

“…In this paper, we study the complexity of several basic operations on linear differential operators with polynomial coefficients…”
Získať plný text

Cylindrical Algebraic Sub-Decompositions Autor Wilson, D. J., Bradford, R. J., Davenport, J. H., England, M.

“…Cylindrical algebraic decompositions (CADs) are a key tool in real algebraic geometry, used primarily for eliminating quantifiers over the reals and studying semi-algebraic sets…”
Získať plný text

Linear programming using limited-precision oracles Autor Gleixner, Ambros, Steffy, Daniel E.

“… When analyzing the time complexity of LP algorithms, it is typically either assumed that calculations are performed exactly and bounds are derived on the number of elementary arithmetic operations…”
Získať plný text

Deterministic root finding over finite fields using Graeffe transforms Autor Grenet, Bruno, van der Hoeven, Joris, Lecerf, Grégoire

“… This algorithm allows for the efficient computation of Graeffe transforms of arbitrary orders…”
Získať plný text

On computing absolutely irreducible components of algebraic varieties with parameters Autor Ayad, Ali

“…This paper presents a new algorithm for computing absolutely irreducible components of n -dimensional algebraic varieties defined implicitly by parametric homogeneous polynomial equations…”
Získať plný text

Multi-point evaluation in higher dimensions Autor van der Hoeven, Joris, Schost, Éric

“… ; one particularly important example is the algebra of truncated power series . Similarly to what is known for multi-point evaluation and interpolation in the univariate case, our algorithms have quasi-linear time complexity…”
Získať plný text

Certified simultaneous isotopic approximation of algebraic curves via subdivision Autor Burr, Michael, Byrd, Michael

“…We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of algebraic curves in the plane…”
Získať plný text

Condition number based complexity estimate for solving polynomial systems Autor She, Zhikun, Xia, Bican, Zheng, Zhiming

“…By modifying and combining algorithms in symbolic and numerical computation, we propose a real-root-counting based method for deciding the feasibility of systems of polynomial equations…”
Získať plný text