TY - BOOK
TI - MONADS: a computer architecture to support software engineering
AU - Gehringer, Edward F.
DA - 1982///
PY - 1982///
PB - Department of Computer Science, Monash University
ER -
TY - THES
TI - On the complexity of factoring polynomials with integer coefficients
AU - Kaltofen, E.
DA - 1982/12//
PY - 1982/12//
M3 - PhD thesis
PB - Rensselaer Polytechnic Institute
ER -
TY - CONF
TI - Dynamic data structure management in MONADS III
AU - Keedy, J.Leslie
AU - Gehringer, Edward F.
AU - Thomson, John V.
T2 - The Fifth Australian Computer Science Conference
C2 - 1982///
C3 - Proceedings of the Fifth Australian Computer Science Conference
CY - Perth, Australia
DA - 1982///
PY - 1982/2/8/
ER -
TY - CHAP
TI - Factorization of Polynomials
AU - Kaltofen, E.
T2 - Computing Supplementum
A2 - Buchberger, B.
A2 - Collins, G.E.
A2 - Loos, R.
T3 - Computing Supplementum
AB - Algorithms for factoring polynomials in one or more variables over various coefficient domains are discussed. Special emphasis is given to finite fields, the integers, or algebraic extensions of the rationals, and to multivariate polynomials with integral coefficients. In particular, various squarefree decomposition algorithms and Hensel lifting techniques are analyzed. An attempt is made to establish a complete historic trace for today’s methods. The exponential worst case complexity nature of these algorithms receives attention.
PY - 1982///
DO - 10.1007/978-3-7091-3406-1_8
SP - 95–113
PB - Springer
SN - 9783211816844 9783709134061
SV - 4
UR - http://dx.doi.org/10.1007/978-3-7091-3406-1_8
ER -
TY - CONF
TI - A polynomial reduction from multivariate to bivariate integral polynomial factorization.
AU - Kaltofen, Erich
T2 - the fourteenth annual ACM symposium
AB - Given an arbitrary but fixed integer r ≥ 3. We show that testing r-variate polynomials with integer coefficients for irreducibility is m-reducible in polynomial time of the total degree and the largest coefficient length to testing bivariate polynomials for irreducibility. Factoring r-variate polynomials into irreducibles is polynomial time Turing-reducible to completely factoring bivariate polynomials.
C2 - 1982///
C3 - Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82
DA - 1982///
DO - 10.1145/800070.802200
PB - ACM Press
SN - 0897910702
UR - http://dx.doi.org/10.1145/800070.802200
DB - Crossref
ER -
TY - CONF
TI - A polynomial-time reduction from bivariate to univariate integral polynomial factorization
AU - Kaltofen, Erich
T2 - 23rd Annual Symposium on Foundations of Computer Science
AB - An algorithm is presented which reduces the problem of finding the irreducible factors of a bivariate polynomial with integer coefficients in polynomial time in the total degree and the coefficient lengths to factoring a univariate integer polynomial. Together with A. Lenstra's, H. Lenstra's and L. Lovasz' polynomial-time factorization algorithm for univariate integer polynomials and the author's multivariate to bivariate reduction the new algorithm implies the following theorem. Factoring a polynomial with a fixed number of variables into irreducibles, except for the constant factors, can be accomplished in time polynomial in the total degree and the size of its coefficients. The new algorithm can be generalized to reducing multivariate factorization directly to univariate factorization and to factoring multivariate polynomials with coefficients in algebraic number fields and finite fields in polynomial time.
C2 - 1982/11//
C3 - 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
DA - 1982/11//
DO - 10.1109/sfcs.1982.56
PB - IEEE
UR - http://dx.doi.org/10.1109/sfcs.1982.56
DB - Crossref
ER -
TY - RPRT
TI - MONADS: a computer architecture to support software engineering
AU - Gehringer, Edward F.
A3 - Department of Computer Science, Monash University
DA - 1982///
PY - 1982///
M1 - 13
M3 - MONADS Report
PB - Department of Computer Science, Monash University
SN - 13
ER -
TY - BOOK
TI - Capability Architectures and Small Objects
AU - Gehringer, Edward F.
DA - 1982///
PY - 1982///
SP - 224
PB - UMI Research Press
ER -
TY - JOUR
TI - The Cm* Testbed
AU - Gehringer, Edward F.
AU - Jones, Anita K.
AU - Segall, Zary Z.
T2 - Computer
DA - 1982/10//
PY - 1982/10//
DO - 10.1109/mc.1982.1653858
VL - 15
IS - 10
SP - 40-53
SN - 0018-9162
UR - http://dx.doi.org/10.1109/mc.1982.1653858
ER -