The following pages link to Journal of Symbolic Computation (Q99061):
Displaying 50 items.
- Types of signature analysis in reliability based on Hilbert series (Q321292) (← links)
- Variant quantifier elimination (Q420753) (← links)
- Ancilla-free synthesis of large reversible functions using binary decision diagrams (Q491242) (← links)
- Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
- On using Lazard's projection in CAD construction (Q492024) (← links)
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme (Q492026) (← links)
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes (Q507148) (← links)
- Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution (Q507359) (← links)
- Solution formulas for cubic equations without or with constraints (Q548598) (← links)
- Some algebraic methods for solving multiobjective polynomial integer programs (Q633078) (← links)
- On the computation of matrices of traces and radicals of ideals (Q654040) (← links)
- Macsyma: A personal history (Q655565) (← links)
- Rational general solutions of planar rational systems of autonomous ODEs (Q719763) (← links)
- Lifting Markov bases and higher codimension toric fiber products (Q898261) (← links)
- Desingularization of Ore operators (Q898287) (← links)
- Solving the conjugacy problem in Garside groups by cyclic sliding. (Q972844) (← links)
- The invariants of the binary decimic (Q979144) (← links)
- Thirty years of polynomial system solving, and now? (Q1006651) (← links)
- The homological reduction method for computing cocyclic Hadamard matrices (Q1012148) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- Betti numbers and minimal free resolutions for multi-state system reliability bounds (Q1030263) (← links)
- Simplification of expressions involving radicals (Q1063634) (← links)
- A structure-preserving clause form translation (Q1098330) (← links)
- Termination of rewriting (Q1098624) (← links)
- Associative-commutative unification (Q1099648) (← links)
- Quantifier elimination: Optimal solution for two classical examples (Q1104314) (← links)
- Gröbner bases and primary decomposition of polynomial ideals (Q1117277) (← links)
- A note on upper bounds for ideal-theoretic problems (Q1185454) (← links)
- Solving zero-dimensional algebraic systems (Q1190743) (← links)
- Hypergeometric solutions of linear recurrences with polynomial coefficients (Q1199820) (← links)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering (Q1318849) (← links)
- A calculus for schemas in Z (Q1583855) (← links)
- An abstract formalization of correct schemas for program synthesis (Q1583858) (← links)
- Identities for the associator in alternative algebras (Q1599547) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Open weak CAD and its applications (Q1711996) (← links)
- Algorithm for computing \(\mu\)-bases of univariate polynomials (Q1712001) (← links)
- Asymptotic \(r\)-log-convexity and P-recursive sequences (Q1733299) (← links)
- An algorithm for computing Schur indices of characters (Q1733308) (← links)
- Semi-automated proof of supercongruences on partial sums of hypergeometric series (Q1733315) (← links)
- New refiners for permutation group search (Q1757005) (← links)
- Constructing Carmichael numbers which are strong pseudoprimes to several bases (Q1911938) (← links)
- Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
- The constraint-based knowledge broker model: Semantics, implementation and analysis (Q2365135) (← links)
- Improved polynomial remainder sequences for Ore polynomials (Q2437284) (← links)
- On a hybrid analytical-experimental technique to assess the storage modulus of resilient materials using symbolic computation (Q2437303) (← links)
- Simplification techniques for maps in simplicial topology (Q2456597) (← links)
- Cumulant varieties (Q2457327) (← links)
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) (Q2635072) (← links)
- Integration of elementary functions (Q2639105) (← links)
