Abstract is missing.
- Symbolic Computation and Complexity Theory Transcript of My TalkErich L. Kaltofen. 3-7 [doi]
- Factorization of MotionsJosef Schicho. 9-11 [doi]
- Simplification of the Lattice Based Attack of Boneh and Durfee for RSA CryptoanalysisYoshinori Aono. 15-32 [doi]
- Real Root Isolation of Regular ChainsFrançois Boulier, Changbo Chen, François Lemaire, Marc Moreno Maza. 33-48 [doi]
- A Practical Implementation of a Modular Algorithm for Ore Polynomial MatricesHoward Cheng, George Labahn. 49-59 [doi]
- Computing Popov Forms of Matrices Over PBW ExtensionsMark Giesbrecht, George Labahn, Yang Zhang. 61-65 [doi]
- On the Simplest Quartic Fields and Related Thue EquationsAkinari Hoshi. 67-85 [doi]
- On the Implementation of Boolean Gröbner BasesShutaro Inoue, Akira Nagai. 87-92 [doi]
- Comprehensive Gröbner Bases in a Java Computer Algebra SystemHeinz Kredel. 93-108 [doi]
- A Practical Method for Floating-Point Gröbner Basis ComputationTateaki Sasaki. 109-124 [doi]
- Series-Expansion of Multivariate Algebraic Functions at Singular Points: Nonmonic CaseTateaki Sasaki, Daiju Inaba. 125-140 [doi]
- A Sequence of Nearest Polynomials with Given FactorsHiroshi Sekigawa. 141-145 [doi]
- Digitization Workflow in the Czech Digital Mathematics LibraryPetr Sojka. 147-156 [doi]
- The Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm Over Boolean Polynomial RingsYao Sun, DingKang Wang. 157-169 [doi]
- Towards the Calculation of Casimir Forces for Inhomogeneous Planar MediaC. Xiong, Thomas W. Kelsey, Stephen A. Linton, Ulf Leonhardt. 171-180 [doi]
- Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the EvaluationsBrice Boyer, Matthew T. Comer, Erich L. Kaltofen. 183-197 [doi]
- An Incremental Algorithm for Computing Cylindrical Algebraic DecompositionsChangbo Chen, Marc Moreno Maza. 199-221 [doi]
- Finding the Symbolic Solution of a Geometric Problem Through Numerical ComputationsLiangyu Chen, Tuo Leng, Liyong Shen, Min Wu, Zhengfeng Yang, Zhenbing Zeng. 223-241 [doi]
- A Symbolic Approach to Compute a Null-Space Basis in the Projection MethodMark Giesbrecht, Nam Pham. 243-259 [doi]
- A Simple Quantifier-Free Formula of Positive Semidefinite Cyclic Ternary Quartic FormsJingjun Han. 261-274 [doi]
- The Vanishing Ideal of a Finite Set of Points with Multiplicity StructuresNa Lei, Xiaopeng Zheng, Yuxue Ren. 275-296 [doi]
- Signature-Based Method of Deciding Program TerminationYaohui Li, YuQing Song, Zhifeng Wu. 297-310 [doi]
- High-Precision Eigenvalue Bound for the Laplacian with SingularitiesXuefeng Liu, Tomoaki Okayama, Shin'ichi Oishi. 311-323 [doi]
- POLY: A New Polynomial Data Structure for Maple 17Michael B. Monagan, Roman Pearce. 325-348 [doi]
- Degree and Dimension Estimates for Invariant Ideals of \(P\) -Solvable RecurrencesMarc Moreno Maza, Rong Xiao. 349-373 [doi]
- Real Root Isolation of Polynomial Equations Based on Hybrid ComputationFei Shen, Wenyuan Wu, Bican Xia. 375-396 [doi]
- Overview of the Mathemagix Type SystemJoris van der Hoeven. 397-425 [doi]
- Resultant-Free Computation of Indefinite Hyperexponential IntegralsXiaoli Wu. 427-435 [doi]
- ImUp: A Maple Package for Uniformity-Improved Reparameterization of Plane CurvesJing Yang, Dongming Wang, Hoon Hong. 437-451 [doi]
- The Diagonal Reduction Algorithm Using Fast GivensWen Zhang, Sanzheng Qiao, Yimin Wei. 453-465 [doi]
- Constructing Generalized Bent Functions from Trace Forms of Galois RingsXiaoming Zhang, Baofeng Wu, Qingfang Jin, Zhuojun Liu. 467-477 [doi]
- Matrix Formulae of Differential Resultant for First Order Generic Ordinary Differential PolynomialsZhi-Yong Zhang, Chun-Ming Yuan, Xiao-Shan Gao. 479-503 [doi]