Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND Volume=174

• Effective Hilbert irreducibility
  E. Kaltofen
  Lecture Notes in Computer Science 174, 1984, pp. 277-284
• GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
  B.W. Char, K.O. Geddes, G.H. Gonnet
  Lecture Notes in Computer Science 174, 1984, pp. 285-296
• A new lifting process for the multivariate polynomial factorization
  D. Lugiez
  Lecture Notes in Computer Science 174, 1984, pp. 297-309
• Explicit construction of the Hilbert class fields of imaginary quadratic fields with class numbers 7 and 11
  E. Kaltofen, N. Yui
  Lecture Notes in Computer Science 174, 1984, pp. 310-320
• On a simple primality testing algorithm
  M.-D.A. Huang
  Lecture Notes in Computer Science 174, 1984, pp. 321-332
• A criterion for the equivalence of two ideals
  J. Buchmann
  Lecture Notes in Computer Science 174, 1984, pp. 333-340
• y' + fy = g
  J.H. Davenport
  Lecture Notes in Computer Science 174, 1984, pp. 341-350
• Integration in finite terms with special functions: A progress report
  G.W. Cherry, B.F. Caviness
  Lecture Notes in Computer Science 174, 1984, pp. 351-358
• A note on the Risch differential equation
  E. Kaltofen
  Lecture Notes in Computer Science 174, 1984, pp. 359-366
• Approximation by continued fraction of a polynomial real root
  K. Thull
  Lecture Notes in Computer Science 174, 1984, pp. 367-377
• On the automatic resolution of certain diophantine equations
  M. Mignotte
  Lecture Notes in Computer Science 174, 1984, pp. 378-385
• On pseudo-resultants
  M. Rothstein
  Lecture Notes in Computer Science 174, 1984, pp. 386-396