default search action
ASCM 2007: Singapore
- Deepak Kapur:
Computer Mathematics, 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers. Lecture Notes in Computer Science 5081, Springer 2008, ISBN 978-3-540-87826-1
Algorithms and Implementations
- Hyeong In Choi, Rida T. Farouki, Chang Yong Han, Hwan Pyo Moon:
Computing the Minkowski Value of the Exponential Function over a Complex Disk. 1-21 - Songxin Liang, David J. Jeffrey:
Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact. 22-31 - Hiroshi Sekigawa:
The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval. 32-41 - Mohab Safey El Din:
Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping. 42-56 - Liangyu Chen, Zhenbing Zeng:
Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method?. 57-71 - Manfred Minimair:
Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis. 72-86 - Nor Aini Aris, Shamsatun Nahar Ahmad:
Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix. 87-96 - Amir Hashemi:
Efficient Algorithms for Computing Nöther Normalization. 97-107 - Moe Thuthu, Seiji Fujino:
Stability of GPBiCG_AR Method Based on Minimization of Associate Residual. 108-120 - Heinz Kredel:
Evaluation of a Java Computer Algebra System. 121-138 - Alain Bretto, Cerasela Jaulin, Luc Gillibert, Bernard Laget:
A New Property of Hamming Graphs and Mesh of d-ary Trees. 139-150
Numerical Methods and Applications
- Hendra Gunawan, F. Pranolo, E. Rusyaman:
An Interpolation Method That Minimizes an Energy Integral of Fractional Order. 151-162 - R. R. Ahmad, A. S. Rambely, L. H. Lim:
Solving Biomechanical Model Using Third-Order Runge-Kutta Methods. 163-168 - Basem S. Attili:
An Efficient Fourth Order Implicit Runge-Kutta Algorithm for Second Order Systems. 169-178 - Suvra Sarkar, Sougata Patra:
Laplace Equation Inside a Cylinder: Computational Analysis and Asymptotic Behavior of the Solution. 179-187 - Zhibin Li, Yinping Liu, Haifeng Qian:
A Method and Its Implementation for Constructing Bäcklund Transformations to Nonlinear Evolution Equations. 188-198 - Ekaterina Shemyakova, Franz Winkler:
On the Invariant Properties of Hyperbolic Bivariate Third-Order Linear Partial Differential Operators. 199-212 - Seripah Awang Kechil, Ishak Hashim:
Symbolic Solution to Magnetohydrodynamic Hiemenz Flow in Porous Media. 213-223 - Anuar Ishak, Roslinda Nazar, Ioan Pop:
Local Similarity Solutions for Laminar Boundary Layer Flow along a Moving Cylinder in a Parallel Stream. 224-235
Elimination: Triangular Forms, Resultants, Equation Solving
- Banghe Li, Dingkang Wang:
An Algorithm for Transforming Regular Chain into Normal Chain. 236-245 - Jia Li, Xiao-Shan Gao:
A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals. 246-262 - Guillaume Moroz:
Regular Decompositions. 263-277 - Tateaki Sasaki, Fujio Kako:
Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation. 278-292 - Eng-Wee Chionh:
The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports. 293-306 - Gui-Lin Zhang, Xiao-Shan Gao:
Properties of Ascending Chains for Partial Difference Polynomial Systems. 307-321
Cryptology
- Xiaoyun Wang:
Some Mathematical Problems in Cryptanalysis. 322 - Maki Iwami:
A Reduction Attack on Algebraic Surface Public-Key Cryptosystems. 323-332
Computational Logic
- Georges Gonthier:
The Four Colour Theorem: Engineering of a Formal Proof. 333 - Yosuke Sato, Akira Nagai, Shutaro Inoue:
On the Computation of Elimination Ideals of Boolean Polynomial Rings. 334-348 - Feifei Ma, Jian Zhang:
Computer Search for Large Sets of Idempotent Quasigroups. 349-358
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.