Amanote Research

Amanote Research

    RegisterSign In

High Probability Analysis of the Condition Number of Sparse Polynomial Systems

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2004.01.006
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

May 1, 2004

Authors
Gregorio MalajovichJ.Maurice Rojas
Publisher

Elsevier BV


Related search

Postmaneuver Collision Probability Estimation Using Sparse Polynomial Chaos Expansions

Journal of Guidance, Control, and Dynamics
ControlSystems EngineeringElectronic EngineeringApplied MathematicsSpaceElectricalPlanetary ScienceAerospace Engineering
2015English

Learning Sparse Polynomial Functions

2013English

A Condition Number for Multifold Conic Systems

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2008English

Comparing the Speed of Programs for Sparse Polynomial Multiplication

ACM SIGSAM Bulletin
2003English

Sparse Polynomial Division Using a Heap

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
2011English

The Number of Irreducible Factors of a Polynomial. I

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1993English

On the Number of Solutions of Decomposable Polynomial Equations

Acta Arithmetica
Number TheoryAlgebra
2002English

Statistical Analysis of NPPs Technological Systems Condition Assessment

Proceedings of Tomsk State University of Control Systems and Radioelectronics
2017English

The Number of Zeros of a Polynomial in a Disk

Journal of Classical Analysis
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy