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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Baron, D., Zippel, R.: Polynomial Decomposition Algorithms. Journal of Symbolic Computation 1, 159–168 (1985)
Cade, J.J.: A New Public-Key Cipher Which Allows Signatures. In: Proceedings of Second SIAM Conference on Applied Linear Algebra, Raleigh, NC (1985)
Giesbrecht, M.: Personal Communication, December 1 (2010)
Kozen, D., Landau, S.: Polynomial Decomposition Algorithms. Journal of Symbolic Computation 7, 445–456 (1989)
Landau, S., Miller, G.L.: Solvability by Radicals is in Polynomial Time. Journal of Computer Systems Science 30, 179–208 (1985)
van der Waerden, B.L.: Algebra. Frederick Ungar Publishing Co. (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)