Symbolic computation and complexity theory. Transcript of my talk

DOI10.1007/978-3-662-43799-5_1MaRDI QIDQ2799547zbMATH OpenOpenAlexFDO

Authors Erich L. Kaltofen

Publication date 12 April 2016

Published in Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43799-5_1

zbMATH Keywords

computational complexityexponential-time algorithmspracticality

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Special issue on symbolic and algebraic computation: ISSAC 2017
• Complexity of computer computations. Proceedings of a symposium on the complexity of computer computations, held March 20--22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, ma
• Foreword to the special focus on advances in symbolic and numeric computation. II
• Special issue on symbolic and algebraic computation: ISSAC 2021
• Theory and applications of models of computation at the Turing centenary in China

Cites work

• The complexity of the word problems for commutative semigroups and polynomial ideals

This page was built for publication: Symbolic computation and complexity theory. Transcript of my talk

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