SYNAPS
From MaRDI portal
Software:13685
swMATH941MaRDI QIDQ13685FDOQ13685
Author name not available (Why is that?)
Cited In (23)
- On the computation of the topology of a non-reduced implicit space curve
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Regularization and matrix computation in numerical polynomial algebra
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Symbolic-numeric methods for solving polynomial equations and applications
- Determining the number of real roots of polynomials through neural networks
- On the complexity of real root isolation using continued fractions
- Title not available (Why is that?)
- Computer Algebra in Scientific Computing
- Algorithms – ESA 2004
- Real algebraic numbers and polynomial systems of small degree
- Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices
- COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS
- Towards and open curved kernel
- Title not available (Why is that?)
- Computer Algebra in Scientific Computing
- Efficient Delaunay mesh generation from sampled scalar functions
- Computer Algebra in Scientific Computing
- Solving polynomial equations. Foundations, algorithms, and applications
- Software for algebraic geometry. Papers of a workshop, Minneapolis, MN, USA, October 23--27, 2006
- On the complexity of real solving bivariate systems
- Efficiency improvement in an \(n\)D systems approach to polynomial optimization
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
This page was built for software: SYNAPS
