Works Published in 1983
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).
Event: 10th Colloquium at Barcelona, Spain on July 18-22, 1983
TL;DR:
A probabilistic algorithm that finds the irreducible factors of a bivariate polynomial with coefficients from a finite field in timePolynomial in the input size, i.e. in the degree of the polynomials and log (cardinality of field).
(via Semantic Scholar)
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.
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).
TL;DR:
It is proved that this algorithm can actually be executed in O(n6(log B)2+n5( log B)3) binary steps by analyzing a modified version of the algorithm which also performs better in practice.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1983 article
Admissible State Semantics for Representational Systems
Computer, Vol. 16, pp. 119–123.
Contributors: J. Doyle*
TL;DR:
This work indicates how many kinds of informal semantics can be transformed directly into formal semantics of no greater complexity.
(via Semantic Scholar)
citeseerx.ist.psu.edu (repository)
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
Contributors: 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
Contributors: 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.
Source: ORCID
Added: December 6, 2019
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
