Journal of Symbolic Computation, Volume 10, 1990

Volume 10, Number 1, July 1990

• Jean-Jacques Risler, F. Ronga:
  Testing Polynomials. 1-6
  
• Dima Grigoriev:
  Complexity of Factoring and Calculating the GCD of Linear Ordinary Differential Operators. 7-38
  
• Marie-Françoise Roy, Aviva Szpirglas:
  Complexity of the Computation on Real Algebraic Numbers. 39-52
  
• Graham H. Norton:
  On the Asymptotic Analysis of the Euclidean Algorithm. 53-58
  
• Michael F. Singer:
  Formal Solutions of Differential Equations. 59-94
  

Volume 10, Number 2, August 1990

• Daniel Ratner, Manfred K. Warmuth:
  NxN Puzzle and Related Relocation Problem. 111-138
  
• Stanley Cabay, Peter Kossowski:
  Power Series Remainder Sequences and Pade Fractions Over an Integral Domain. 138-164
  
• Thomas Becker:
  Standard Bases and Some Computations in Rings of Power Series. 165-178
  
• A. Deprit, Etienne Deprit:
  Processing Poisson Series in Parallel. 179-202
  
• Vladimir P. Gerdt, A. Yu. Zharkov:
  Computer Classification of Integrable Coupled KdV-like Systems. 203-208
  
• A. K. Heng:
  Some Remarks On Numerical Iterations in a Symbolic Manipulation System. 209-221
  

Volume 10, Number 3/4, September/October 1990

• Panagiotis Alevizos, Jean-Daniel Boissonnat, Mariette Yvinec:
  Non Convex Contour Reconstruction. 225-252
  
• Ketan Mulmuley:
  A Fast Planar Partition Algorithm, I. 253-280
  
• Bernard Chazelle, Micha Sharir:
  An Algorithm for Generalized Point Location and its Applications. 281-310
  
• David Avis, Hiroshi Imai:
  Locating a Robot with Angle Mathematics. 311-326
  
• Nimrod Megiddo:
  On the Complexity of Some Geometric Problems in Unbounded Dimension. 327-334
  
• Herbert Edelsbrunner, Franco P. Preparata, Douglas B. West:
  Tetrahedrizing Point Sets in Three Dimensions. 335-348
  
• Chee-Keng Yap:
  Symbolic Treatment of Geometric Degeneration. 349-370
  
• Jacob T. Schwartz, Micha Sharir:
  On the Two-Dimensional Davenport Schinzel Problem. 371-393
  

Volume 10, Number 5, November 1990

• Volker Weispfenning:
  The Complexity of Almost Linear Diophantine Problems. 395-404
  
• Felipe Cucker, Marie-Françoise Roy: Kac's Theorem on the Number of Real Roots and its Consequences in Average Complexity. 405-410
• Harry B. Hunt III, Richard Edwin Stearns:
  The Complexity of Equivalence for Commutative Rings. 411-436
  
• Joachim von zur Gathen:
  Functional Decomposition of Polynomials: The Wild Case. 437-452
  
• Marie-Hélène Mathieu, David Ford:
  On p-adic Computation of the Rational Form of a Matrix. 453-464
  
• P. Beckman, J. Stückrad:
  The Concept of Gröbner Algebras. 465-480
  
• Gerard Lallement, R. McFadden:
  On the Determination of Green's Relations in Finite Tranformation Semigroups. 481-498
  
• G. C. Nielsen, M. O. McLinden, G. Morrison:
  Use of Computer Algebra to Locate Critical Loci in Fluid Mixtures. 499-508
  
• Naren Vira, T. Gill, Edward Tunstel:
  Application of Symbolic Computation in Robot Pose Error Modeling. 509-524
  
• M. D. Abouzahra, P. Pavelle:
  Computer Algebra Applied to Radiation from Microstrip Discontinuities. 525-528
  

Volume 10, Number 6, December 1990

• N. Klingen:
  Leopoldt's Conjecture for Imaginary Galois Number Fields. 531-546
  
• Joachim von zur Gathen, Mark Giesbrecht:
  Constructing Normal Bases in Finite Fields. 547-570
  
• Gert Almkvist, Doron Zeilberger:
  The Method of Differentiating under the Integral Sign. 571-592
  
• Jeffrey Shallit:
  On the Worst Case of Three Algorithms for Computing the Jacobi Symbol. 593-610
  
• John Shackell:
  Growth Estimates for Exp-Log Functions. 611-632
  
• W. Nef, Peter-Michael Schmidt:
  Computing a Sweeping-Plane in Regular ("General") Position: A Numerical and a Symbolic Solution. 633-646
  
• Robert A. Wilson:
  The 2- and 3 Modular Characters of J3, its Covering Group and Automorhism Group. 647-657
  
• D. I. Hughes:
  Symbolic Computation with Fermions. 657-664
  

Last update Mon Feb 13 04:53:20 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page