default search action
LMS Journal of Computation and Mathematics, Volume 3
Volume 3, 2000
- Andrew A. Adams:
A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs. 1-26 - Graeme J. Barclay, David F. Griffiths, Desmond J. Higham:
Theta Method Dynamics. 27-43 - Arieh Iserles, Antonella Zanna:
On the Dimension of Certain Graded Lie Algebras Arising in Geometric Integration of Differential Equations. 44-75 - B. M. Brown, Michael S. P. Eastham:
Spectral Concentration for Perturbed Equations of Harmonic Oscillator Type. 76-85 - Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. 86-95 - Catherine S. Greenhill:
An Algorithm for Recognising the Exterior Square of a Multiset. 96-116 - Leslie Ann Goldberg, Mark Jerrum:
Counting Unlabelled Subtrees of a Tree is #P-complete. 117-124 - Manfred Einsiedler, Graham Everest, Thomas Ward:
Primes in Sequences Associated to Polynomials (After Lehmer). 125-139 - Jacques D. Fleuriot, Lawrence C. Paulson:
Mechanizing Nonstandard Real Analysis. 140-190 - Douglas S. Bridges, Robin Havea:
A Constructive Analysis of a Proof that the Numerical Range is Convex. 191-206 - N. P. Kirk:
Computational Aspects of Classifying Singularities. 207-228 - J. D. Howroyd:
A Domain-Theoretic Approach to Integration in Hausdorff Spaces. 229-273 - Frauke M. Bleher, Wolfgang Kimmerle:
On the Structure of Integral Group Rings of Sporadic Groups. 274-306 - William H. Foster, Ilia Krasikov:
Explicit Bounds for Hermite Polynomials in the Oscillatory Region. 307-314 - Christopher T. H. Baker, Evelyn Buckwar:
Numerical Analysis of Explicit One-Step Methods for Stochastic Delay Differential Equations. 315-335 - Stefania Cavallar, Franz Lemmermeyer:
Euclidean Windows. 336-355
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.