Skip to main navigation Skip to search Skip to main content

On the Complexity of Symbolic Computation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we survey various basic and higher level tasks in computer algebra from the complexity perspective. Particular attention is paid to problems that are fundamental from this point of view and interconnections between other problems.

Original languageEnglish
Title of host publicationISSAC 2022 - Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation47th International Symposium on Symbolic and Algebraic Computation, ISSAC 2022
EditorsAmir Hashemi
PublisherAssociation for Computing Machinery
Pages3-12
Number of pages10
ISBN (Electronic)9781450386883
DOIs
Publication statusPublished - 4 Jul 2022
Event47th International Symposium on Symbolic and Algebraic Computation, ISSAC 2022 - Virtual, Online, France
Duration: 4 Jul 20227 Jul 2022

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Conference

Conference47th International Symposium on Symbolic and Algebraic Computation, ISSAC 2022
Country/TerritoryFrance
CityVirtual, Online
Period4/07/227/07/22

Keywords

  • algorithm
  • complexity
  • survey
  • symbolic computation

Fingerprint

Dive into the research topics of 'On the Complexity of Symbolic Computation'. Together they form a unique fingerprint.

Cite this