scientific article; zbMATH DE number 1446863
From MaRDI portal
Publication:4953977
Recommendations
Cited in
(only showing first 100 items - show all)- Complete numerical isolation of real roots in zero-dimensional triangular systems
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Investigations on algorithmic questions of algebra
- Issues of algorithmics and Glushkov's systems of algorithmic algebras
- Subresultants revisited.
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Univariate real root isolation in an extension field and applications
- On the complexity of the Lickteig-Roy subresultant algorithm
- Recent progress in exact geometric computation
- Homology in electromagnetic boundary value problems
- Multilinear polynomial systems: root isolation and bit complexity
- Solutions to the Einstein constraint equations with a small TT-tensor and vanishing Yamabe invariant
- Searching for applicable versions of computable structures
- The complexity of approximating the complex-valued Potts model
- Separation bounds for polynomial systems
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- On the complexity of computing with planar algebraic curves
- A bound for orders in differential Nullstellensatz
- Krandick's proof of Lagrange's real root bound claim
- Chinese remainder theorem for cyclotomic polynomials in \(\mathbb Z[X]\)
- On the Davenport-Mahler bound
- Real algebraic numbers and polynomial systems of small degree
- Complexity of real root isolation using continued fractions
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- Certified rational parametric approximation of real algebraic space curves with local generic position method
- On the complexity of the Descartes method when using approximate arithmetic
- On the complexity of real root isolation using continued fractions
- Exact, efficient, and complete arrangement computation for cubic curves
- The predicates of the Apollonius diagram: algorithmic analysis and implementation
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- Algebraic diagonals and walks: algorithms, bounds, complexity
- On the complexity of computing the topology of real algebraic space curves
- Continuous amortization and extensions: with applications to bisection-based root isolation
- A Lower Bound for Computing Lagrange’s Real Root Bound
- New spherical (2 s + 1)-designs from Kuperberg's set: an experimental result
- scientific article; zbMATH DE number 3885305 (Why is no real title available?)
- Solving bivariate systems using rational univariate representations
- scientific article; zbMATH DE number 3875525 (Why is no real title available?)
- Consistency of quasi-static boundary value problems in electromagnetic modelling
- SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE
- Deterministic random walks on the two-dimensional grid
- Thomas decomposition of algebraic and differential systems
- THE PREDICATES FOR THE EXACT VORONOI DIAGRAM OF ELLIPSES UNDER THE EUCLIDIEAN METRIC
- Foundations of Exact Rounding
- On the Complexity of Reliable Root Approximation
- scientific article; zbMATH DE number 4110093 (Why is no real title available?)
- Improved bounds for the CF algorithm
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- scientific article; zbMATH DE number 1296286 (Why is no real title available?)
- scientific article; zbMATH DE number 517393 (Why is no real title available?)
- Algorithmic Thomas decomposition of algebraic and differential systems
- Univariate real root isolation over a single logarithmic extension of real algebraic numbers
- scientific article; zbMATH DE number 1832214 (Why is no real title available?)
- scientific article; zbMATH DE number 1881996 (Why is no real title available?)
- Separating linear forms and rational univariate representations of bivariate systems
- A generic position based method for real root isolation of zero-dimensional polynomial systems
- Random arithmetic formulas can be reconstructed efficiently
- Computing real roots of real polynomials
- Newton's method and the computational complexity of the fundamental theorem of algebra
- Binary component decomposition. I: The positive-semidefinite case
- Computer algebra. An algorithm-oriented introduction. Translated and updated from the 2006 German language edition
- On \(\mu\)-symmetric polynomials
- ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS
- On the extreme points of moments sets
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- Computeralgebra
- The Convergence of Bird Flocking
- Absolute root separation
- Nearly optimal computations with structured matrices
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
- Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound
- Regarding an adaptive algorithm for testing multivariate linear dependence
- Counting solutions of a polynomial system locally and exactly
- Using signature sequences to classify intersection curves of two quadrics
- On the topology of real algebraic plane curves
- Complexity of a root clustering algorithm for holomorphic functions
- On the complexity of Chow and Hurwitz forms
- An improved complexity bound for computing the topology of a real algebraic space curve
- A general approach to isolating roots of a bitstream polynomial
- Globally convergent, iterative path-following for algebraic equations
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm
- Computing the non-properness set of real polynomial maps in the plane
- The eigenvalue problem for the Laplacian via conformal mapping and the Gohberg-Sigal theory
- Computing linear relations between polynomial roots
- Root finding with threshold circuits
- A stochastic objective-function-free adaptive regularization method with optimal complexity
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Tight security for BBS signatures
- Quadratic-time computations for pseudo-Anosov mapping classes
- Polynomials whose roots are the differences of the roots of a given polynomial
- Subalgebras of the univariate polynomial algebra
- A worst-case bound for topology computation of algebraic curves
- Fields of algebraic numbers computable in polynomial time. I
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- Constructive root bound for \(k\)-ary rational input numbers
- Nearly optimal refinement of real roots of a univariate polynomial
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
- An efficient local approach to convexity testing of piecewise-linear hypersurfaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953977)
