Skip to main content
SpringerLink
Log in
Book cover

Logic and Program Semantics pp 329–332Cite as

Timesharing Dexter

  • Chapter

  • 782 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7230))

Abstract

My husband Neil Immerman returned from the 1986 STOC meeting with an interesting proposition. Juris Hartmanis and Dexter Kozen had a small pocket of funds, and they proposed that the two of us visit the Cornell Computer Science Department for a week.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alagar, V.S., Thanh, M.: Fast Polynomial Decomposition Algorithms. In: Caviness, B.F. (ed.) EUROCAL 1985, Part II. LNCS, vol. 204, pp. 150–153. Springer, Heidelberg (1985)

    Google Scholar 

  2. Baron, D., Zippel, R.: Polynomial Decomposition Algorithms. Journal of Symbolic Computation 1, 159–168 (1985)

    Article  MathSciNet  Google Scholar 

  3. Cade, J.J.: A New Public-Key Cipher Which Allows Signatures. In: Proceedings of Second SIAM Conference on Applied Linear Algebra, Raleigh, NC (1985)

    Google Scholar 

  4. Giesbrecht, M.: Personal Communication, December 1 (2010)

    Google Scholar 

  5. Kozen, D., Landau, S.: Polynomial Decomposition Algorithms. Journal of Symbolic Computation 7, 445–456 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  6. Landau, S., Miller, G.L.: Solvability by Radicals is in Polynomial Time. Journal of Computer Systems Science 30, 179–208 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  7. van der Waerden, B.L.: Algebra. Frederick Ungar Publishing Co. (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Harvard University, USA

    Susan Landau

Authors
  1. Susan Landau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Cornell University, 4149 Upson Hall, 14853, Ithaca, NY, USA

    Robert L. Constable

  2. Intelligent Systems Faculty of Science, Institute for Computing and Information Sciences, Radboud University Nijmegen, Postbus 9010, 6500 GL, Nijmegen, The Netherlands

    Alexandra Silva

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Landau, S. (2012). Timesharing Dexter. In: Constable, R.L., Silva, A. (eds) Logic and Program Semantics. Lecture Notes in Computer Science, vol 7230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29485-3_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29485-3_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29484-6

  • Online ISBN: 978-3-642-29485-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation