Correction to ``Computational complexity of algebraic functions

DOI10.1016/0022-0000(88)90015-3zbMATH Open0655.68037OpenAlexW2042819908MaRDI QIDQ1109564FDOQ1109564

Authors: Nicholas Pippenger 

Publication date: 1988

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(88)90015-3

Recommendations

• Corrigendum to: ``On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
• Corrigendum to: ``On the field of definition of a cubic rational function and its critical points.
• Errata to: The algebra of slice functions
• Correction to: Depth functions of symbolic powers of homogeneous ideals
• Erratum: Factoring Polynomials over Algebraic Number Fields

zbMATH Keywords

straight line programscost of root extractionradical complexityrational function of roots

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic numbers; rings of algebraic integers (11R04)

Cites Work

• Computational complexity of algebraic functions

Cited In (5)

• Title not available (Why is that?)
• Errata to: The algebra of slice functions
• Corrigendum to: ``On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
• Correction to: ``Tropical varieties for exponential sums
• Comments on ``Arithmetic complexity, Kleene closure, and formal power series

This page was built for publication: Correction to ``Computational complexity of algebraic functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109564)