Computational complexity of algebraic functions

DOI10.1016/0022-0000(81)90043-XMaRDI QIDQ1157164zbMATH OpenFDO

Authors Nicholas Pippenger

Publication date 1981

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

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)

Cited in

(2)

• Correction to ``Computational complexity of algebraic functions
• Computability of the additive complexity of algebraic circuits with root extracting

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

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