te Riele, Herman J. J. The Mertens conjecture. (English) Zbl 1404.11002 Ji, Lizhen (ed.) et al., The legacy of Bernhard Riemann after one hundred and fifty years. Volume II. Somerville, MA: International Press; Beijing: Higher Education Press (ISBN 978-1-57146-319-7/pbk; 978-1-57146-316-6/set). Advanced Lectures in Mathematics (ALM) 35, 2, 703-718 (2016). MSC: 11-03 11-02 11N37 11M26 11Y35 PDF BibTeX XML Cite \textit{H. J. J. te Riele}, in: The legacy of Bernhard Riemann after one hundred and fifty years. Volume II. Somerville, MA: International Press; Beijing: Higher Education Press. 703--718 (2016; Zbl 1404.11002)
Futa, Yuichi; Okazaki, Hiroyuki; Shidama, Yasunari Torsion part of \(\mathbb{Z}\)-module. (English) Zbl 1334.13008 Formaliz. Math. 23, No. 4, 297-307 (2015). MSC: 13C12 13C10 03B35 PDF BibTeX XML Cite \textit{Y. Futa} et al., Formaliz. Math. 23, No. 4, 297--307 (2015; Zbl 1334.13008) Full Text: DOI
Park, Jaehyun; Park, Yunju Efficient lattice reduction updating and downdating methods and analysis. (English) Zbl 1329.15075 J. Korean Soc. Ind. Appl. Math. 19, No. 2, 171-188 (2015). MSC: 15B99 PDF BibTeX XML Cite \textit{J. Park} and \textit{Y. Park}, J. Korean Soc. Ind. Appl. Math. 19, No. 2, 171--188 (2015; Zbl 1329.15075) Full Text: DOI Link
Futa, Yuichi; Okazaki, Hiroyuki; Nakasho, Kazuhisa; Shidama, Yasunari Torsion \(\mathbb Z\)-module and torsion-free \(\mathbb Z\)-module. (English) Zbl 1316.13012 Formaliz. Math. 22, No. 4, 277-289 (2014). MSC: 13C10 13C12 03B35 PDF BibTeX XML Cite \textit{Y. Futa} et al., Formaliz. Math. 22, No. 4, 277--289 (2014; Zbl 1316.13012) Full Text: DOI
Watkins, Mark Some comments about indefinite LLL. (English) Zbl 1353.11059 Chan, Wai Kiu (ed.) et al., Diophantine methods, lattices, and arithmetic theory of quadratic forms. Proceedings of the international workshop, Banff International Research Station (BIRS), Alberta, Canada, November 13–18, 2011. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-8318-1/pbk; 978-0-8218-9503-0/ebook). Contemporary Mathematics 587, 233-243 (2013). Reviewer: István Gaál (Debrecen) MSC: 11D09 11Y50 PDF BibTeX XML Cite \textit{M. Watkins}, Contemp. Math. 587, 233--243 (2013; Zbl 1353.11059)
Chun, Joohwan; Park, Jaehyun An efficient algorithm for clustered integer least squares problems. (English) Zbl 1274.65113 Numer. Linear Algebra Appl. 19, No. 1, 19-30 (2012). MSC: 65F20 90C10 90C20 PDF BibTeX XML Cite \textit{J. Chun} and \textit{J. Park}, Numer. Linear Algebra Appl. 19, No. 1, 19--30 (2012; Zbl 1274.65113) Full Text: DOI
van Hoeij, Mark; Pal, Vivek Isomorphisms of algebraic number fields. (English. French summary) Zbl 1282.11142 J. Théor. Nombres Bordx. 24, No. 2, 293-305 (2012). Reviewer: Andreas Stein (Oldenburg) MSC: 11R04 11Y40 PDF BibTeX XML Cite \textit{M. van Hoeij} and \textit{V. Pal}, J. Théor. Nombres Bordx. 24, No. 2, 293--305 (2012; Zbl 1282.11142) Full Text: DOI arXiv
Chang, Xiao-Wen; Stehlé, Damien; Villard, Gilles Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction. (English) Zbl 1260.11082 Math. Comput. 81, No. 279, 1487-1511 (2012). MSC: 11Y16 11H06 15A23 65F25 65F35 PDF BibTeX XML Cite \textit{X.-W. Chang} et al., Math. Comput. 81, No. 279, 1487--1511 (2012; Zbl 1260.11082) Full Text: DOI
Luk, Franklin T.; Qiao, San-zheng Matrices and the LLL algorithm. (English) Zbl 1217.65059 Jin, Xiao-Qing (ed.) et al., Recent advances in scientific computing and matrix analysis. Papers based on the presentations at the international workshop, Macau, China, December 28–30, 2009. Dedicated to the 30th anniversary of University of Macau (1981–2011). Somerville, MA: International Press; Beijing: Higher Education Press (ISBN 978-1-57146-202-2/pbk). 61-69 (2011). MSC: 65F05 PDF BibTeX XML Cite \textit{F. T. Luk} and \textit{S.-z. Qiao}, in: Recent advances in scientific computing and matrix analysis. Papers based on the presentations at the international workshop, Macau, China, December 28--30, 2009. Dedicated to the 30th anniversary of University of Macau (1981--2011). Somerville, MA: International Press; Beijing: Higher Education Press. 61--69 (2011; Zbl 1217.65059)
Stehlé, Damien Floating-point LLL: Theoretical and practical aspects. (English) Zbl 1186.65052 Nguyen, Phong Q. (ed.) et al., The LLL algorithm. Survey and applications. Dordrecht: Springer (ISBN 978-3-642-02294-4/hbk; 978-3-642-02295-1/ebook). Information Security and Cryptography, 179-213 (2010). MSC: 65F25 12Y05 68W30 PDF BibTeX XML Cite \textit{D. Stehlé}, in: The LLL algorithm. Survey and applications. Dordrecht: Springer. 179--213 (2010; Zbl 1186.65052) Full Text: DOI
Vallée, Brigitte; Vera, Antonio Probabilistic analyses of lattice reduction algorithms. (English) Zbl 1230.11156 Nguyen, Phong Q. (ed.) et al., The LLL algorithm. Survey and applications. Dordrecht: Springer (ISBN 978-3-642-02294-4/hbk; 978-3-642-02295-1/ebook). Information Security and Cryptography, 71-143 (2010). Reviewer: Juan Tena Ayuso (Valladolid) MSC: 11Y16 11H06 11H31 11H55 52C07 PDF BibTeX XML Cite \textit{B. Vallée} and \textit{A. Vera}, in: The LLL algorithm. Survey and applications. Dordrecht: Springer. 71--143 (2010; Zbl 1230.11156) Full Text: DOI
Nguyen, Phong Q. Hermite’s constant and lattice algorithms. (English) Zbl 1230.11155 Nguyen, Phong Q. (ed.) et al., The LLL algorithm. Survey and applications. Dordrecht: Springer (ISBN 978-3-642-02294-4/hbk; 978-3-642-02295-1/ebook). Information Security and Cryptography, 19-69 (2010). Reviewer: Juan Tena Ayuso (Valladolid) MSC: 11Y16 11H06 11H31 11H55 52C07 PDF BibTeX XML Cite \textit{P. Q. Nguyen}, in: The LLL algorithm. Survey and applications. Dordrecht: Springer. 19--69 (2010; Zbl 1230.11155) Full Text: DOI
Smeets, Ionica; Lenstra, Arjen; Lenstra, Hendrik; Lovász, László; Van Emde Boas, Peter The history of the LLL-algorithm. In collaboration with Arjen Lenstra, Hendrik Lenstra, László Lovász, and Peter van Emde Boas. (English) Zbl 1230.11002 Nguyen, Phong Q. (ed.) et al., The LLL algorithm. Survey and applications. Dordrecht: Springer (ISBN 978-3-642-02294-4/hbk; 978-3-642-02295-1/ebook). Information Security and Cryptography, 1-17 (2010). MSC: 11-03 11Y16 90C10 PDF BibTeX XML Cite \textit{I. Smeets} et al., in: The LLL algorithm. Survey and applications. Dordrecht: Springer. 1--17 (2010; Zbl 1230.11002) Full Text: DOI
Akhavi, Ali; Marckert, Jean-François; Rouault, Alain On the reduction of a random basis. (English) Zbl 1185.15030 ESAIM, Probab. Stat. 13, 437-458 (2009). Reviewer: Václav Burjan (Praha) MSC: 15B52 15A03 60B12 06B99 68W40 65F25 PDF BibTeX XML Cite \textit{A. Akhavi} et al., ESAIM, Probab. Stat. 13, 437--458 (2009; Zbl 1185.15030) Full Text: DOI EuDML
Krishnamoorthy, Bala; Pataki, Gábor Column basis reduction and decomposable knapsack problems. (English) Zbl 1176.90418 Discrete Optim. 6, No. 3, 242-270 (2009). MSC: 90C10 90C27 PDF BibTeX XML Cite \textit{B. Krishnamoorthy} and \textit{G. Pataki}, Discrete Optim. 6, No. 3, 242--270 (2009; Zbl 1176.90418) Full Text: DOI arXiv
Khorramizadeh, Mostafa A note on solving linear Diophantine systems by using \(L^3\)-reduction algorithm. (English) Zbl 1234.11166 Int. J. Comput. Math. 86, No. 5, 883-896 (2009). MSC: 11Y50 11D04 11D45 68W40 90C10 PDF BibTeX XML Cite \textit{M. Khorramizadeh}, Int. J. Comput. Math. 86, No. 5, 883--896 (2009; Zbl 1234.11166) Full Text: DOI Link
Filaseta, Michael; Granville, Andrew; Schinzel, Andrzej Irreducibility and greatest common divisor algorithms for sparse polynomials. (English) Zbl 1270.11129 McKee, James (ed.) et al., Number theory and polynomials. Proceedings of the workshop, Bristol, UK, April 3–7, 2006. Cambridge: Cambridge University Press (ISBN 978-0-521-71467-9/pbk). London Mathematical Society Lecture Note Series 352, 155-176 (2008). Reviewer: Carlos D’Andrea (Barcelona) MSC: 11Y16 12Y05 68W30 11C08 11R09 PDF BibTeX XML Cite \textit{M. Filaseta} et al., Lond. Math. Soc. Lect. Note Ser. 352, 155--176 (2008; Zbl 1270.11129) Full Text: DOI
Luk, Franklin T.; Tracy, Daniel M. An improved LLL algorithm. (English) Zbl 1132.65032 Linear Algebra Appl. 428, No. 2-3, 441-452 (2008). Reviewer: Tzvetan Semerdjiev (Sofia) MSC: 65F20 PDF BibTeX XML Cite \textit{F. T. Luk} and \textit{D. M. Tracy}, Linear Algebra Appl. 428, No. 2--3, 441--452 (2008; Zbl 1132.65032) Full Text: DOI
Akhavi, Ali; Marckert, Jean-François; Rouault, Alain On the reduction of a random basis. (English) Zbl 1429.15032 Panario, Daniel (ed.) et al., Proceedings of the 4th workshop on analytic algorithmics and combinatorics (ANALCO ’07), New Orleans, LA, USA, January 6, 2007. Proceedings in Applied Mathematics 126. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 265-270 (2007). MSC: 15B52 11Y16 15A03 60B12 68W40 PDF BibTeX XML Cite \textit{A. Akhavi} et al., in: Proceedings of the 4th workshop on analytic algorithmics and combinatorics (ANALCO '07), New Orleans, LA, USA, January 6, 2007. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 265--270 (2007; Zbl 1429.15032) Full Text: DOI
Schnorr, Claus Peter Fast LLL-type lattice reduction. (English) Zbl 1108.11090 Inf. Comput. 204, No. 1, 1-25 (2006). MSC: 11Y16 11H06 68Q25 68W30 PDF BibTeX XML Cite \textit{C. P. Schnorr}, Inf. Comput. 204, No. 1, 1--25 (2006; Zbl 1108.11090) Full Text: DOI
Jäger, G. Reduction of Smith normal form transformation matrices. (English) Zbl 1078.65034 Computing 74, No. 4, 377-388 (2005). Reviewer: Adhemar Bultheel (Leuven) MSC: 65F30 65F05 15B36 11D04 15A21 PDF BibTeX XML Cite \textit{G. Jäger}, Computing 74, No. 4, 377--388 (2005; Zbl 1078.65034) Full Text: DOI
Ajtai, Miklós Generating hard instances of lattice problems. (English) Zbl 1071.11041 Krajíček, Jan (ed.), Complexity of computations and proofs. Rome: Aracne; Napoli: Dipartimento di Matematica della Seconda Università di Napoli (ISBN 88-7999-413-1/hbk). Quaderni di Matematica 13, 1-32 (2004). Reviewer: Juan Tena Ayuso (Valladolid) MSC: 11H06 68Q17 11Y16 PDF BibTeX XML Cite \textit{M. Ajtai}, Quad. Mat. 13, 1--32 (2004; Zbl 1071.11041)
Ellis, Graham; Kholodna, Irina Three-dimensional presentations for the groups of order at most 30. (English) Zbl 0957.57013 LMS J. Comput. Math. 2, 93-117 (1999). Reviewer: Michael Joachim (Münster) MSC: 57M99 20B40 20J06 PDF BibTeX XML Cite \textit{G. Ellis} and \textit{I. Kholodna}, LMS J. Comput. Math. 2, 93--117 (1999; Zbl 0957.57013) Full Text: DOI Link
Havas, George; Majewski, Bohdan S.; Matthews, Keith R. Extended GCD and Hermite normal form algorithms via lattice basis reduction. (English) Zbl 0922.11112 Exp. Math. 7, No. 2, 125-136 (1998). Reviewer: Alex Bijlsma (Utrecht) MSC: 11Y16 11A05 11C20 PDF BibTeX XML Cite \textit{G. Havas} et al., Exp. Math. 7, No. 2, 125--136 (1998; Zbl 0922.11112) Full Text: DOI EMIS EuDML
Paulus, Sachar Lattice basis reduction in function fields. (English) Zbl 0935.11045 Buhler, J. P. (ed.), Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21-25, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1423, 567-575 (1998). Reviewer: Claus Fieker (Berlin) MSC: 11Y16 11R58 14H40 PDF BibTeX XML Cite \textit{S. Paulus}, Lect. Notes Comput. Sci. 1423, 567--575 (1998; Zbl 0935.11045)
Schlickewei, Hans Peter Lower bounds for heights on finitely generated groups. (English) Zbl 0973.11067 Monatsh. Math. 123, No. 2, 171-178 (1997). Reviewer: Jan-Hendrik Evertse (Leiden) MSC: 11G50 11H06 PDF BibTeX XML Cite \textit{H. P. Schlickewei}, Monatsh. Math. 123, No. 2, 171--178 (1997; Zbl 0973.11067) Full Text: DOI EuDML
Trevisan, Vilmar Polynomial factorization. (English) Zbl 0866.11075 Mat. Contemp. 7, 185-198 (1994). Reviewer: F.J.Wright (London) MSC: 11Y05 68W30 12D05 11T06 PDF BibTeX XML Cite \textit{V. Trevisan}, Mat. Contemp. 7, 185--198 (1994; Zbl 0866.11075)
Yokoyama, Kazuhiro; Noro, Masayuki; Takeshima, Taku Multi-modular approach to polynomial-time factorization of bivariate integral polynomials. (English) Zbl 0820.11077 J. Symb. Comput. 17, No. 6, 545-563 (1994). Reviewer: F.J.Wright (London) MSC: 11Y16 68W30 12Y05 11R09 13P05 PDF BibTeX XML Cite \textit{K. Yokoyama} et al., J. Symb. Comput. 17, No. 6, 545--563 (1994; Zbl 0820.11077) Full Text: DOI
Daudé, Hervé; Vallée, Brigitte An upper bound on the average number of iterations of the LLL algorithm. (English) Zbl 0796.11024 Theor. Comput. Sci. 123, No. 1, 95-115 (1994). Reviewer: M.Pohst (Berlin) MSC: 11H55 11Y16 68Q25 PDF BibTeX XML Cite \textit{H. Daudé} and \textit{B. Vallée}, Theor. Comput. Sci. 123, No. 1, 95--115 (1994; Zbl 0796.11024) Full Text: DOI
Tijdeman, Rob Diophantine approximation and its applications. (English) Zbl 0812.11038 Edixhoven, Bas (ed.) et al., Diophantine approximation and abelian varieties. Introductory lectures. Papers of the conference, held in Soesterberg, Netherlands, April 12-16, 1992. Berlin: Springer-Verlag. Lect. Notes Math. 1566, 13-20 (1993). Reviewer: W.Kleinert (Berlin) MSC: 11Jxx 11-02 11D41 11-03 11D72 PDF BibTeX XML Cite \textit{R. Tijdeman}, Lect. Notes Math. 1566, 13--20 (1993; Zbl 0812.11038)
Kaltofen, Erich; Yui, Noriko Explicit construction of the Hilbert class fields of imaginary quadratic fields by integer lattice reduction. (English) Zbl 0737.11034 Number theory, Proc. Semin., New York/NY (USA) 1989-1990, 149-202 (1991). Reviewer: H.Cohn (New York) MSC: 11R37 11Y16 12-04 12F10 12Y05 PDF BibTeX XML
Pethö, Attila Computational methods for the resolution of diophantine equations. (English) Zbl 0704.11006 Number theory, Proc. 1st Conf. Can. Number Theory Assoc., Banff/Alberta (Can.) 1988, 477-492 (1990). Reviewer: R.P.Steiner MSC: 11D25 11Y50 11J86 PDF BibTeX XML
Granot, Frieda; Skorin-Kapov, Jadranka On simultaneous approximation in quadratic integer programming. (English) Zbl 1418.90187 Oper. Res. Lett. 8, No. 5, 251-255 (1989). MSC: 90C20 90C10 PDF BibTeX XML Cite \textit{F. Granot} and \textit{J. Skorin-Kapov}, Oper. Res. Lett. 8, No. 5, 251--255 (1989; Zbl 1418.90187) Full Text: DOI
Fujishige, Satoru; Röck, Hans; Zimmermann, Uwe A strongly polynomial algorithm for minimum cost submodular flow problems. (English) Zbl 0677.90027 Math. Oper. Res. 14, No. 1, 60-69 (1989). MSC: 90B10 90C35 68Q25 PDF BibTeX XML Cite \textit{S. Fujishige} et al., Math. Oper. Res. 14, No. 1, 60--69 (1989; Zbl 0677.90027) Full Text: DOI
de Weger, B. M. M. Erratum. “Solving exponential diophantine equations using lattice basis reduction algorithms”. (English) Zbl 0657.10016 J. Number Theory 31, No. 1, 88-89 (1989). MSC: 11D61 11-04 11D75 11H06 PDF BibTeX XML Cite \textit{B. M. M. de Weger}, J. Number Theory 31, No. 1, 88--89 (1989; Zbl 0657.10016) Full Text: DOI
de Weger, B. M. M. Algorithms for diophantine equations. (English) Zbl 0687.10013 CWI Tract, 65. Amsterdam: Centrum voor Wiskunde en Informatica. viii, 212 p. Dfl. 33.00 (1989). Reviewer: I.Gaál MSC: 11D61 11-02 11-04 11D41 11D99 PDF BibTeX XML Cite \textit{B. M. M. de Weger}, Algorithms for diophantine equations. Amsterdam: Centrum voor Wiskunde en Informatica (1989; Zbl 0687.10013)
Just, Bettina Integer relations among algebraic numbers. (English) Zbl 0755.68069 Mathematical foundations of computer science, Proc. 14th Symp., MFCS ’89, Porąbka-Kozubnik/Pol. 1989, Lect. Notes Comput. Sci. 379, 314-320 (1989). MSC: 68Q25 68W30 12F10 PDF BibTeX XML
Radziszowski, Stanisław P.; Kreher, Donald L. Solving subset sum problems with the \(L^ 3\) algorithm. (English) Zbl 0657.90070 J. Comb. Math. Comb. Comput. 3, 49-63 (1988). MSC: 90C10 68Q25 65K05 90C27 90C09 PDF BibTeX XML Cite \textit{S. P. Radziszowski} and \textit{D. L. Kreher}, J. Comb. Math. Comb. Comput. 3, 49--63 (1988; Zbl 0657.90070)
Kannan, R.; Lenstra, A. K.; Lovász, László Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. (English) Zbl 0654.12001 Math. Comput. 50, No. 181, 235-250 (1988). Reviewer: M.Pohst MSC: 11R09 11Y16 11Y40 68W30 PDF BibTeX XML Cite \textit{R. Kannan} et al., Math. Comput. 50, No. 181, 235--250 (1988; Zbl 0654.12001) Full Text: DOI
Frieze, Alan M.; Håstad, Johan; Kannan, Ravi; Lagarias, Jeffrey C.; Shamir, Adi Reconstructing truncated integer variables satisfying linear congruences. (English) Zbl 0654.10006 SIAM J. Comput. 17, No. 2, 262-280 (1988). Reviewer: Michael Pohst (Berlin) MSC: 11Y16 11A07 68Q25 94A60 PDF BibTeX XML Cite \textit{A. M. Frieze} et al., SIAM J. Comput. 17, No. 2, 262--280 (1988; Zbl 0654.10006) Full Text: DOI
Schnorr, C. P. Geometry of numbers and integer programming. (English) Zbl 0644.90063 STACS 88, Theoretical aspects of computer science, Proc. 5th Annu. Symp., Bordeaux/France 1988, Lect. Notes Comput. Sci. 294, 1-7 (1988). Reviewer: J.Piehler MSC: 90C10 11H06 PDF BibTeX XML
Pethö, A.; Schulenberg, R. Effektives Lösen von Thue Gleichungen. (Practical solving of Thue equations). (German) Zbl 0657.10015 Publ. Math. 34, No. 3-4, 189-196 (1987). Reviewer: R.P.Steiner MSC: 11D41 PDF BibTeX XML Cite \textit{A. Pethö} and \textit{R. Schulenberg}, Publ. Math. 34, No. 3--4, 189--196 (1987; Zbl 0657.10015)
Lenstra, Arjen K. Factoring multivariate polynomials over algebraic number fields. (English) Zbl 0636.12005 SIAM J. Comput. 16, 591-598 (1987). Reviewer: M.Pohst MSC: 11R09 68W30 12-04 PDF BibTeX XML Cite \textit{A. K. Lenstra}, SIAM J. Comput. 16, 591--598 (1987; Zbl 0636.12005) Full Text: DOI
Buchmann, Johannes; Williams, H. C. On principal ideal testing in totally complex quartic fields and the determination of certain cyclotomic constants. (English) Zbl 0626.12006 Math. Comput. 48, 55-66 (1987). Reviewer: M.Pohst MSC: 11R16 11H06 12-04 11T22 11R18 PDF BibTeX XML Cite \textit{J. Buchmann} and \textit{H. C. Williams}, Math. Comput. 48, 55--66 (1987; Zbl 0626.12006) Full Text: DOI
de Weger, B. M. M. Solving exponential diophantine equations using lattice basis reduction algorithms. (English) Zbl 0625.10013 J. Number Theory 26, 325-367 (1987). Reviewer: A.Pethö MSC: 11D61 11D75 11-04 11H06 PDF BibTeX XML Cite \textit{B. M. M. de Weger}, J. Number Theory 26, 325--367 (1987; Zbl 0625.10013) Full Text: DOI
Just, Bettina Effiziente Kettenbruchalgorithmen in beliebigen Dimensionen. (Efficient continued fraction algorithms in arbitrary dimensions). (German) Zbl 0707.11045 Frankfurt am Main: Univ., Diss. 97 S. (1987). Reviewer: M.Pohst MSC: 11J70 11J13 68Q25 11Y16 68W30 PDF BibTeX XML Cite \textit{B. Just}, Effiziente Kettenbruchalgorithmen in beliebigen Dimensionen. (Efficient continued fraction algorithms in arbitrary dimensions). Frankfurt am Main: Univ. (1987; Zbl 0707.11045)
Möller, Heinrich On computations with respect to Mertens’ conjecture. (Zur Numerik der Mertens’schen Vermutung.) (German) Zbl 0744.11069 Ulm: Univ. Ulm, Fak. f. Naturwissenschaft und Mathematik, 141 S. (1987). Reviewer: H.J.J.te Riele (Amsterdam) MSC: 11Y70 11A25 11J20 11M06 11N05 PDF BibTeX XML Cite \textit{H. Möller}, Zur Numerik der Mertens'schen Vermutung. Ulm: Univ. Ulm, Fak. f. Naturwissenschaft und Mathematik (1987; Zbl 0744.11069)
Pohst, Michael On methods of the geometry of numbers in constructive algebraic number theory. (Über zahlengeometrische Methoden in der konstruktiven algebraischen Zahlentheorie.) (German) Zbl 0634.12001 Ber. Math.-Stat. Sekt. Forschungszent. Joanneum 270, 23 p. (1986). Reviewer: J. Buchmann (Saarbrücken) MSC: 11Y40 11R27 11R29 11Y16 11P21 11D57 PDF BibTeX XML Full Text: DOI
Kannan, Ravi; McGeoch, Lyle A. Basis reduction and evidence for transcendence of certain numbers. (English) Zbl 0616.10027 Foundations of software technology and theoretical computer science, Proc. 6th Conf., New Delhi/India 1986, Lect. Notes Comput. Sci. 241, 263-269 (1986). Reviewer: M.Pohst MSC: 11J81 11H06 11J04 68W99 PDF BibTeX XML
Håstad, Johan; Helfrich, B.; Lagarias, J.; Schnorr, C. P. Polynomial time algorithms for finding integer reations among real numbers. (English) Zbl 0606.68033 Theoretical aspects of computer science, 3rd Annu. Symp., Orsay/France 1986, Lect. Notes Comput. Sci. 210, 105-118 (1986). MSC: 68Q25 11-04 11H06 68W30 PDF BibTeX XML
Kannan, R. Lattices, basis reduction and the shortest vector problem. (English) Zbl 0603.12001 Theory of algorithms, Colloq. Pécs/Hung. 1984, Colloq. Math. Soc. János Bolyai 44, 283-311 (1986). Reviewer: J. Buchmann (Saarbrücken) MSC: 11Y16 11H06 68W30 90C10 PDF BibTeX XML
Zassenhaus, Hans On polynomial factorization. (English) Zbl 0606.12001 Rocky Mt. J. Math. 15, 657-665 (1985). Reviewer: N.L.Manev MSC: 11R09 12D05 11H55 12-04 PDF BibTeX XML Cite \textit{H. Zassenhaus}, Rocky Mt. J. Math. 15, 657--665 (1985; Zbl 0606.12001) Full Text: DOI
Dieter, U. Calculating shortest vectors in a lattice. (English) Zbl 0606.10024 Ber. Math.-Stat. Sekt. Forschungszent. Graz 244, 14 p. (1985). Reviewer: M.Pohst MSC: 11H06 11H50 65C10 PDF BibTeX XML
Kaltofen, Erich Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization. (English) Zbl 0605.12001 SIAM J. Comput. 14, 469-489 (1985). MSC: 11R09 68W30 11Y16 12-08 12D05 11T06 PDF BibTeX XML Cite \textit{E. Kaltofen}, SIAM J. Comput. 14, 469--489 (1985; Zbl 0605.12001) Full Text: DOI
Lenstra, A. K. Factoring multivariate polynomials over finite fields. (English) Zbl 0577.12013 J. Comput. Syst. Sci. 30, 235-248 (1985). Reviewer: Nikolai L. Manev (Sofia) MSC: 11T06 68W30 12D05 65Yxx PDF BibTeX XML Cite \textit{A. K. Lenstra}, J. Comput. Syst. Sci. 30, 235--248 (1985; Zbl 0577.12013) Full Text: DOI
Lagarias, J. C. The computational complexity of simultaneous diophantine approximation problems. (English) Zbl 0563.10025 SIAM J. Comput. 14, 196-209 (1985). Reviewer: M.Frumkin MSC: 68Q25 PDF BibTeX XML Cite \textit{J. C. Lagarias}, SIAM J. Comput. 14, 196--209 (1985; Zbl 0563.10025) Full Text: DOI
Schönhage, Arnold Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm. (English) Zbl 0569.68030 Automata, languages and programming, 11th Colloq., Antwerp/Belg. 1984, Lect. Notes Comput. Sci. 172, 436-447 (1984). MSC: 68W30 68Q25 12D05 PDF BibTeX XML
Lenstra, Arjen K. Factoring multivariate polynomials over algebraic number fields. (English) Zbl 0568.12001 Mathematical foundations of computer science, Proc. 11th Symp., Praha/Czech. 1984, Lect. Notes Comput. Sci. 176, 389-396 (1984). Reviewer: Arjen K. Lenstra MSC: 11Y16 11R09 68W30 11Y40 PDF BibTeX XML
Fincke, Ulrich Ein Ellipsoidverfahren zur Lösung von Normgleichungen in algebraischen Zahlkörpern. (English) Zbl 0559.10012 Mathematisch-Naturwissenschaftliche Fakultät der Universität Düsseldorf. 116 S. (1984). Reviewer: A.Pethö MSC: 11D57 11R27 11H55 11-04 12-04 68Q25 PDF BibTeX XML
Lenstra, Arjen K. Polynomial factorization by root approximation. (English) Zbl 0551.12018 EUROSAM 84, Symbolic and algebraic computation, Proc. int. Symp., Cambridge/Engl. 1984, Lect. Notes Comput. Sci. 174, 272-276 (1984). MSC: 12D05 68Q25 68W30 PDF BibTeX XML
Kaltofen, Erich On the complexity of finding short vectors in integer lattices. (English) Zbl 0546.68022 Computer algebra, EUROCAL ’83, Proc. Conf., London 1983, Lect. Notes Comput. Sci. 162, 236-244 (1983). MSC: 68W30 68Q25 11H06 PDF BibTeX XML
Lenstra, A. K. Factoring polynomials over algebraic number fields. (English) Zbl 0539.68030 Computer algebra, EUROCAL ’83, Proc. Conf., London 1983, Lect. Notes Comput. Sci. 162, 245-254 (1983). MSC: 68Q25 11R09 PDF BibTeX XML
Kaltofen, Erich; Musser, David R.; Saunders, B. David A generalized class of polynomials that are hard to factor. (English) Zbl 0529.68018 SIAM J. Comput. 12, 473-483 (1983). MSC: 68W30 11R09 68Q25 11R18 PDF BibTeX XML Cite \textit{E. Kaltofen} et al., SIAM J. Comput. 12, 473--483 (1983; Zbl 0529.68018) Full Text: DOI
von zur Gathen, Joachim; Kaltofen, Erich Polynomial-time factorization of multivariate polynomials over finite fields. (English) Zbl 0526.12002 Automata, languages and programming, 10th Colloq., Barcelona/Spain 1983, Lect. Notes Comput. Sci. 154, 250-263 (1983). MSC: 12-04 11T06 68W99 68W30 PDF BibTeX XML
Lenstra, A. K. Factoring multivariate integral polynomials. (English) Zbl 0526.12001 Automata, languages and programming, 10th Colloq., Barcelona/Spain 1983, Lect. Notes Comput. Sci. 154, 458-465 (1983). MSC: 11-04 11Y16 11R09 68W30 PDF BibTeX XML
Lenstra, H. W. jun. Integer programming with a fixed number of variables. (English) Zbl 0524.90067 Math. Oper. Res. 8, 538-548 (1983). MSC: 90C10 68Q25 90C05 PDF BibTeX XML Cite \textit{H. W. Lenstra jun.}, Math. Oper. Res. 8, 538--548 (1983; Zbl 0524.90067) Full Text: DOI
Lauer, Markus Generalized p-adic constructions. (English) Zbl 0516.13008 SIAM J. Comput. 12, 395-410 (1983). MSC: 13B25 68W30 13J15 11D41 11S05 13-04 13F20 PDF BibTeX XML Cite \textit{M. Lauer}, SIAM J. Comput. 12, 395--410 (1983; Zbl 0516.13008) Full Text: DOI
Chistov, A. L.; Grigor’ev, D. Yu. Polynomial-time factoring of the multivariable polynomials over a global field. (English) Zbl 0509.68029 Prepr. LOMI, E-5-82, 39 p. (1982). MSC: 68Q25 12F05 12E05 68W30 PDF BibTeX XML
Lenstra, A. K.; Lenstra, H. W. jun.; Lovász, László Factoring polynomials with rational coefficients. (English) Zbl 0477.68043 Math. Cent., Amst., Afd. Inf. IW 195/82, 30 p. (1982). MSC: 11Y16 11C08 11R09 68W30 PDF BibTeX XML