Symbolic Computation and Complexity Theory Transcript of My Talk

DOI10.1007/978-3-662-43799-5_1zbMath1352.68296OpenAlexW128943420MaRDI QIDQ2799547

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

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

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