Computer Science - 1983

von zur Gathen, J., & Kaltofen, E. (1983). Polynomial-time factorization of multivariate polynomials over finite fields. In Lecture Notes in Computer Science: Vol. 154. Automata, Languages and Programming (pp. 250–263). https://doi.org/10.1007/bfb0036913

Kaltofen, E., Musser, D. R., & Saunders, B. D. (1983). A Generalized Class of Polynomials that are Hard to Factor. SIAM Journal on Computing, 12(3), 473–483. https://doi.org/10.1137/0212031

Kaltofen, E. (1983). On the complexity of finding short vectors in integer lattices. In Lecture Notes in Computer Science (pp. 236–244). https://doi.org/10.1007/3-540-12868-9_107

Doyle, J. (1983). Admissible State Semantics for Representational Systems. Computer, Vol. 16, pp. 119–123. https://doi.org/10.1109/MC.1983.1654209

Doyle, J. (1983). SOCIETY OF MIND - MULTIPLE PERSPECTIVES, REASONED ASSUMPTIONS, AND VIRTUAL COPIES. 1, 309–314. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-0020892425&partnerID=MN8TOARS

Doyle, J. (1983). INS AND OUTS OF REASON MAINTENANCE. 1, 349–351. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-0020909766&partnerID=MN8TOARS

Stallmann, M. F. M. (1983). AN AUGMENTING PATHS ALGORITHM FOR THE MATROID PARITY PROBLEM ON BINARY MATROIDS. University of Colorado, Boulder.