A Polynomial-Time Complexity Bound for the Computation of the Singular Part of a Puiseux Expansion of an Algebraic Function

Mathematics of Computation - United States
doi 10.1090/s0025-5718-00-01246-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

On the Upper Bound of the Number of Real Zeros of a Random Algebraic Polynomial

Journal of Classical Analysis
2012English

A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2011English

The Computation of a Certain Metric Invariant of an Algebraic Number Field

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1982English

A Time Complexity Lower Bound for Adaptive Mutual Exclusion

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2011English

On Hahn Polynomial Expansion of a Continuous Function of Bounded Variation

PAMM
2016English

A Divisibility Theorem for the Alexander Polynomial of a Plane Algebraic Curve

Journal of Mathematical Sciences
MathematicsApplied MathematicsStatisticsProbability
2004English

An Asymptotic Expansion for the Expected Number of Real Zeros of a Random Polynomial

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices

SIAM Journal on Matrix Analysis and Applications
Analysis
2010English

An Algebraic Theory of Complexity for Discrete Optimization

SIAM Journal on Computing
MathematicsComputer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy