Works Published in 1987
Displaying all 9 works
Sorted by most recent date added to the index first, which may not be the same as publication date order.
1987 report
Fast multiplication of polynomials over arbitrary rings
(Technical Report No. 87-35). Troy, NY: Rensselaer Polytechnic Institute, Department of Computer Science.
Source: NC State University Libraries
Added: March 26, 2022
1987 journal article
Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
SIAM Journal on Algebraic Discrete Methods, 8(4), 683–690.
TL;DR:
A polynomial-time deterministic sequential algorithm for the Smith normal form over the rationals, which is applied to the rational canonical form of matrices over finite fields and the field of rational numbers.
(via Semantic Scholar)
semanticscholar.org (repository)
Source: Crossref
Added: August 28, 2020
1987 journal article
Computer Algebra Algorithms
Annual Review of Computer Science, 2(1), 91–118.
TL;DR:
A systematic review of Integer and Polynomial Addition, Multiplication, and Division with Remainder and its applications in Language and System Design and Decision Methods for Elementary Algebr a and Geometry.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1987 conference paper
Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials
Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87. Presented at the the nineteenth annual ACM conference.
Event: the nineteenth annual ACM conference
TL;DR:
Three theorems are presented that establish polynomial straight-line complexity for certain operations on polynomials given bystraight-line programs of unbounded input degree, and a higher order partial derivative in a single variable is shown.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1987 journal article
Deterministic irreducibility testing of polynomials over large finite fields
Journal of Symbolic Computation, 4(1), 77–82.
TL;DR:
This work presents a sequential deterministic polynomial-time algorithm for testing dense multivariate polynomials over a large finite field for irreducibility, based on the algorithm for absolute irreduceibility testing combined with Berlekamp's algorithm.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1987 journal article
Logic, rationality, and rational psychology
Computational Intell, 3(1), 175–176.
Contributors: J. Doyle*
TL;DR:
In summary, McDermott’s critique of nonmonotonic logic is myopic, and it may be the case that nonMonotonic inference does not help the logicist position, but McDermott has not made this case.
(via Semantic Scholar)
Source: ORCID
Added: December 5, 2019
1987 article
Admissible State Semantics for Representational Systems
The Knowledge Frontier, pp. 174–186.
Source: ORCID
Added: December 5, 2019
1987 book
Parallel Processing: The Cm* Experience
Digital Press.
Sources: NC State University Libraries, ORCID
Added: April 14, 2019
1987 journal article
A STRUCTURE-BASED MODEL OF SEMANTIC INTEGRITY CONSTRAINTS FOR RELATIONAL DATABASES
ENGINEERING WITH COMPUTERS, 2(1), 31–39.
Contributors: W. Rasdorf n, K. Ulberg n & J. Baugh Jr.
TL;DR:
This paper presents a formalism that classifies semantic integrity constraints based on the structure of the relational model, allowing the arbitrary specification of any constraint.
(via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018
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.
