Skip to main content
SpringerLink
Log in

Symbolic Computation and Complexity Theory Transcript of My Talk

  • Conference paper
  • First Online:
Computer Mathematics

  • 705 Accesses

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.

This material is based on work supported in part by the National Science Foundation under Grants CCF-1115772.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Fischer, M.J., Rabin, M.O.: Super-exponential complexity of presburger arithmetic. In: R. M. Karp, editor, Complexity of Computation, pp. 27–41. Amer. Math. Soc. (1974)

    Google Scholar 

  2. Mayr, E.W., Meyer, A.R.: The complexity of the word problem for commutative semigroups and polynomial ideals. Advances Math. 46, 305–329 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fröhlich, A., Shepherdson, J.C.: Effective procedures in field theory. Phil. Trans. Roy. Soc. Ser. A 248, 407–432 (1955/1956)

    Google Scholar 

  4. Cook, S.A.: Computational complexity of higher type functions. In: Proceedings of the ICM Kyoto Japan, ICM Series, pp. 55–69 (1990)

    Google Scholar 

  5. Kaltofen, E., Trager, B.: Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. J. Symbolic Comput., 9(3):301–320 (1990) URL: http://www.math.ncsu.edu/kaltofen/bibliography/90/KaTr90.pdf

  6. Kaltofen, E., Koiran, P.: Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. In: Jean-Guillaume Dumas, editor, ISSAC MMVI Proceedings of the 2006 International Symposium Symbolic Algebraic Computation, pp. 162–168, New York, N. Y., 2006. ACM Press. ISBN 1-59593-276-3. URL: http://www.math.ncsu.edu/kaltofen/bibliography/06/KaKoi06.pdf

  7. Guo, F., Kaltofen, E.L., Zhi, L.: Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. In: Joris van der Hoeven and Mark van Hoeij, editors, ISSAC 2012 Proceedings of the 37th International Symposium Symbolic Algebraic Computation, pp. 195–202, New York, N. Y., July 2012. Association for Computing Machinery. ISBN 978-1-4503-1269. URL: http://www.math.ncsu.edu/kaltofen/bibliography/12/GKZ12.pdf;URL: http://arxiv.org/abs/1203.0253

  8. Faugère, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Proceedings of the Eurocrypt 2010, volume 6110 of Lecture Notes in Computer Science, pp. 279–298, Heidelberg, Germany, 2010. Springer Verlag

    Google Scholar 

  9. Guo, Q., Safey El Din, M., Zhi, L.: Computing rational solutions of linear matrix inequalities. In: Manuel Kauers, editor, ISSAC 2013 Proceedings of the 38th International Symposium Symbolic Algebraic Computation, New York, N. Y., 2013. Association for Computing Machinery

    Google Scholar 

  10. Villard, G.: Computing the Frobenius normal form of a sparse matrix. In: Proceedings of the Third International Workshop on Computer Algebra in Scientific Computing, pp. 395–407, Heidelberg, Germany, 2000. Springer Verlag

    Google Scholar 

  11. Kaltofen, E., Shoup, V.: Subquadratic-time factoring of polynomials over finite fields. Math. Comput., 67(223):1179–1197, July 1998. URL: http://www.math.ncsu.edu/kaltofen/bibliography/98/KaSh98.pdf

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, North Carolina State University, Raleigh, NC, 27695-8205, USA

    Erich L. Kaltofen

Authors
  1. Erich L. Kaltofen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Erich L. Kaltofen .

Editor information

Editors and Affiliations

  1. Academy of Mathematics & System Science, Beijing, China

    Ruyong Feng

  2. Department of Mathematics and Computer S, University of Antwerp, Antwerp, Antwerpen, Belgium

    Wen-shin Lee

  3. Department of Mathematical Information S, Tokyo University of Science, Tokyo, Tokyo, Japan

    Yosuke Sato

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaltofen, E.L. (2014). Symbolic Computation and Complexity Theory Transcript of My Talk. In: Feng, R., Lee, Ws., Sato, Y. (eds) Computer Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43799-5_1

Download citation

Publish with us

Policies and ethics

Search

Navigation