Works Published in 1985
Displaying works 21 - 31 of 31 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
1985 conference paper
Computing with polynomials given by straight-line programs I: greatest common divisors
Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85. Presented at the the seventeenth annual ACM symposium.
Event: the seventeenth annual ACM symposium
TL;DR:
This work develops algorithms on multivariate polynomials represented by straight-line programs for the greatest common divisor problem and conversion to sparse representation and in random polynomial-time for the usual coefficient fields and output.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1985 journal article
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
SIAM Journal on Computing, 14(2), 469–489.
TL;DR:
An algorithm is presented which reduces the problem of finding the irreducible factors of f in polynomial-time in the total degree of f and the coefficient lengths of f to factoring a univariate integral polynomials, which implies the following theorem.
(via Semantic Scholar)
semanticscholar.org (repository)
Source: Crossref
Added: August 28, 2020
1985 journal article
Factoring sparse multivariate polynomials
Journal of Computer and System Sciences, 31(2), 265–287.
TL;DR:
A probabilistic reduction for factoring polynomials from multivariate to the bivariate case, over an arbitrary (effectively computable) field, based on an effective version of Hilbert's irreducibility theorem is presented.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1985 chapter
Sparse hensel lifting
In EUROCAL '85 (pp. 4–17).
TL;DR:
It is shown how the content of the input polynomial in the main variable as a by-product can be taken advantage of when computing the GCD of multivariate polynomials by sparse Hensel lifting.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1985 journal article
Broyden's method for approximate solution of nonlinear integral equations
Journal of Integral Equations, 9(1), 25–44.
Sources: ORCID, NC State University Libraries
Added: August 29, 2019
1985 journal article
Why does the {F_N}-Method work?
Trans. Th. Stat. Phys., 14, 513–526.
Source: ORCID
Added: August 29, 2019
1985 conference paper
Analytical determination of normal contact stresses for arbitrary geometries with application to the tire/pavement interaction mechanism
In T. D. Gillespie & M. Sayers (Eds.), Measuring Road Roughness and its Effects on User Cost and Comfort (pp. 162–178). Baltimore.
Ed(s): T. Gillespie & M. Sayers
Event: American Society for Testing and Materials at Baltimore
Source: ORCID
Added: August 29, 2019
1985 journal article
Expanded Convergence Domains for Newton’s Method at Nearly Singular Roots
SIAM Journal on Scientific and Statistical Computing, 6(4), 951–966.
Sources: Crossref, ORCID
Added: July 28, 2019
1985 journal article
Broyden’s Method for a Class of Problems Having Singular Jacobian at the Root
SIAM Journal on Numerical Analysis, 22(3), 566–574.
Sources: Crossref, ORCID
Added: July 28, 2019
1985 report
How to embed trees in hypercubes
(Research Report No. 443). New Haven, Connecticut: Department of Computer Science, Yale University.
Source: NC State University Libraries
Added: July 10, 2019
1985 journal article
Why does the -method work?
Transport Theory and Statistical Physics, 14, 513–526.
Source: NC State University Libraries
Added: July 10, 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.
