Computer Science

College of Engineering

Works Published in 1983

copy embed code
Copy Embed Code Experiment

You can embed this resource into your own website. To do so, either use the code generated by us, or use the link and tweak the rest to your preferences. Copy the respective code or link below.

Displaying all 7 works

Sorted by most recent date added to the index first, which may not be the same as publication date order.

1983 chapter

Polynomial-time factorization of multivariate polynomials over finite fields

In Lecture Notes in Computer Science: Vol. 154. Automata, Languages and Programming (pp. 250–263).

By: J. von zur Gathen* & E. Kaltofen*

Event: 10th Colloquium at Barcelona, Spain on July 18-22, 1983

Source: Crossref
Added: June 15, 2021

1983 journal article

A Generalized Class of Polynomials that are Hard to Factor

SIAM Journal on Computing, 12(3), 473–483.

By: E. Kaltofen*, D. Musser & B. Saunders

Source: Crossref
Added: August 28, 2020

1983 chapter

On the complexity of finding short vectors in integer lattices

In Lecture Notes in Computer Science (pp. 236–244).

Source: Crossref
Added: August 28, 2020

1983 article

Admissible State Semantics for Representational Systems

Computer, Vol. 16, pp. 119–123.

By: J. Doyle*

Source: ORCID
Added: December 6, 2019

1983 conference paper

SOCIETY OF MIND - MULTIPLE PERSPECTIVES, REASONED ASSUMPTIONS, AND VIRTUAL COPIES.

1, 309–314. http://www.scopus.com/inward/record.url?eid=2-s2.0-0020892425&partnerID=MN8TOARS

By: J. Doyle

Source: ORCID
Added: December 6, 2019

1983 conference paper

INS AND OUTS OF REASON MAINTENANCE.

1, 349–351. http://www.scopus.com/inward/record.url?eid=2-s2.0-0020909766&partnerID=MN8TOARS

By: J. Doyle

Source: ORCID
Added: December 6, 2019

1983 thesis

AN AUGMENTING PATHS ALGORITHM FOR THE MATROID PARITY PROBLEM ON BINARY MATROIDS.

University of Colorado, Boulder.

By: M. Stallmann

Source: ORCID
Added: December 6, 2019