Symbolic Computation and Complexity Theory Transcript of My Talk

Erich L. Kaltofen ()
Additional contact information
Erich L. Kaltofen: North Carolina State University, Department of Mathematics

A chapter in Computer Mathematics, 2014, pp 3-7 from Springer

Abstract: Abstract I gave talks at the conference Alan Turing’s Heritage: Logic, Computation & Complexity in Lyon, France on July 3, 2012, at the Pierre and Marie Curie University (UPMC) Paris 6, France on July 17, 2012, and at the Tenth Asian Symposium on Computer Mathematics (ASCM) in Beijing, China, on October 26, 2012 on the complexity theoretic hardness of many problems that the discipline of symbolic computation tackles.

Keywords: Computational complexity; Exponential-time algorithms; Practicality (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-43799-5_1

Ordering information: This item can be ordered from
http://www.springer.com/9783662437995

DOI: 10.1007/978-3-662-43799-5_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().