yusuke1997/dblp-id-title huggingface dataset:
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
Component-level parallelization of triangular decompositions
Stabilization of Polynomial Systems Solving with Groebner Bases
Optimization Techniques for Symbolic Equation Solver in Engineering Applications
Algorithms for Structured Linear Systems Solving and Their Implementation
Bounds for degrees of minimal μ : bases of parametric surfaces
Constructing Permutation Representations for Large Matrix Groups
A new view on HJLS and PSLQ: sums and projections of lattices
Cylindrical algebraic decompositions for boolean combinations
Sub-cubic change of ordering for Gröbner basis: a probabilistic approach
Software Components for Computer Algebra
Algorithms for trigonometric polynomials
Criteria for Finite Difference Gröbner Bases of Normal Binomial Difference Ideals
Some inequalities about univariate polynomials
Deciding linear-trigonometric problems
A Unified Approach to Unimodality of Gaussian Polynomials
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019
Faster LLL-type Reduction of Lattice Bases
Cache-oblivious Matrix Multiplication for Exact TU Factorisation
The differential Hilbert function of a differential rational mapping can be computed in polynomial time
Experiments with Quadtree Representation of Matrices
Near Optimal Subdivision Algorithms for Real Root Isolation
Symbolic Computation of Parameter Integrals
Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant K
International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014
An Approach for Certifying Homotopy Continuation Paths: Univariate Case
Decomposition of Algebras
Triangular decomposition of semi-algebraic systems
FIDE: a REDUCE package for automation of FInite difference method for solving pDE
Solving projective complete intersection faster
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
What Can (and Can't) we Do with Sparse Polynomials?
On finding multiplicities of characteristic polynomial factors of black-box matrices
Scalable parallel coset enumeration using bulk definition
Formal Solutions of Linear Differential Systems with Essential Singularities in their Coefficients
Symbolic Calculation of Zero Dynamics for Nonlinear Control Systems
From Honest to Intelligent Plotting
Enhanced computations of gröbner bases in free algebras as a new application of the letterplace paradigm
Network Servers for Symbolic Mathematics
Detecting Algebraic Dependencies Between Unnested Radicals (abstract)
Implicitization and parametrization of quadratic surfaces with one simple base point
Multiplication polynomials for elliptic curves over finite local rings
A new zero-test for formal power series
How We Proved That There Are Exactly 924 Cyclic 7-Roots
Compound Program Packages and a Nonlinear Random Fluctuations Analysis
Existence of Quantum Symmetries for Graphs on Up to Seven Vertices: A Computer based Approach
Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
Algebraic Transformations of Polynomial Equations, Symmetric Polynomials and Elimination
Novel Range Functions via Taylor Expansions and Recursive Lagrange Interpolation with Application to Real Root Isolation
Probabilistic algorithms for computing resultants
Symmetries of 2 nd and 3 rd Order ODE's
New Sparse Multivariate Polynomial Factorization Algorithms over Integers
Blendstrings: an environment for computing with smooth functions
Acceleration of Euclidean algorithm and extensions
Formal Solutions of Scalar Singularly-Perturbed Linear Differential Equations
Stability analysis of biological systems with real solution classification
Computing Normalizers in Permutation p -Groups
Power series solutions of singular (q)-differential equations
Polynomial-time algorithm for Hilbert series of Borel type ideals
Branch Cuts in Computer Algebra
Reliable Krylov-based algorithms for matrix null space and rank
An Algorithm for Determining the Regulator and the Fundamental Unit of Hyperelliptic congruence Function Field
Computer Evaluation of Cyclicity in Planar Cubic System
The Albert Nonassociative Algebra System: A Progress Report
Refined telescoping algorithms in RΠΣ -extensions to reduce the degrees of the denominators✱
The complexity of factoring univariatepolynomials over the rationals: tutorial abstract
Modular Techniques for Intermediate Primary Decomposition
Border Basis Computation with Gradient-Weighted Normalization
Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings
Existence Problem of Telescopers for Rational Functions in Three Variables: the Mixed Cases
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001
Faster real root decision algorithm for symmetric polynomials
On the subresultant PRS algorithm
Algebraic Techniques in Geometry: The 10th Anniversary
Computational aspects of elliptic curves and modular forms
Reconstruction Algorithms for Sums of Affine Powers
When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial
A Nearly Linear Algorithm for Sylow Subgroups in Small-Base Groups
A Critical-Pair/Completion Based Integration Algorithm
De Nugis Groebnerialium 4: Zacharias, Spears, Möller
Numerical primary decomposition
Local Approximation Study of Difference Operators by Means of REDUCE System
Computing an invariant subring of k[X, Y]
Symbolic Computation for Witt Rings
The automatic derivation of periodic solutions to a class of weakly nonlinear differential equations
Resolvent Computations by Resultants Without Extraneous Powers
An effective description of the roots of bivariates mod pk and the related Igusa's local zeta function
Canonical Representations in Lisp and Applications to Computer Algebra systems
Generalized normal forms and polynomial system solving
Enumerating polynomial colored permutation classes
Solving polynomial systems: a complexity theory viewpoint
A new deterministic algorithm for sparse multivariate polynomial interpolation
Marginal Independence Models
Computing the Galois group of a polynomial using linear differential equations
An Algebra of Properties
A Meta Simplifier
Validated Numerics for Algebraic Path Tracking
Minkowski Decomposition and Geometric Predicates in Sparse Implicitization
Solving Linear Difference Equations with Coefficients in Rings with Idempotent Representations
Obtaining Exact Steady-state Responses in Driven Undamped Oscillators
Better simplification of elementary functions through power series
Factoring bivariate lacunary polynomials without heights
Fast and exact geometric analysis of real algebraic plane curves
Integrated System INTERCOMP and Computer Language for Physicists
Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis
Simplification of algebraic expression by multiterm rewriting rules
Computation of Dimension in Filtered Free Modules by Gröbner Reduction
Gröbner-free normal forms for boolean polynomials
Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants
Efficient detection of redundancies in systems of linear inequalities✱
A probabilistic algorithm to test local algebraic observability in polynomial time
Mathematics by machine
Separable Automorphisms on Matrix Algebras over Finite Field Extensions: Applications to Ideal Codes
A fast implementation of polynomial factorization
Guessing with Little Data
An OpenMath 1.0 Implementation
Existence Theorems for Polynomial First Integrals
Baby-Step Giant-Step Algorithms for the Symmetric Group
A Reordered Schur Factorization Method for Zero-dimensional Polynomial Systems with Multiple Roots
Resolvents and Symmetric Functions
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
Symbolic integration at compile time in finite element methods
The basis of a computer system for modern algebra
Applicability of Zeilberger's algorithm to hypergeometric terms
Symbolic/numeric algorithms for partial differential equations
Computation of the Smith Normal Form of Polynomial Matrices
On the design and implementation of Brown's algorithm over the integers and number fields
A Generalization of the Binary GCD Algorithm
Structure and asymptotic expansion of multiple harmonic sums
Singular Systems of Polynomials
Efficiently Factoring Polynomials Modulo p4
The definition and use of data structures in REDUCE
Automatic generation of finite difference equations and fourier stability analyses
Newton's method: a great algebraic algorithm
On computing polynomial GCDs in alternate bases
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC '98, Rostock, Germany, August 13-15, 1998
Taking advantage of zero entries in the exact inverse of sparse matrices
Computer algebra and numerical integration
The Probability of Relative Primality of Gaussian Integers
Effective Tests for Cyclotonic Polynomials
Equivalences for Linearizations of Matrix Polynomials
An Object-Oriented Language for Symbolic Computation - Applied to Machine Element Analysis
Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding
Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction
Computation schemes for splitting fields of polynomials
FFPACK: finite field linear algebra package
Schemes for deterministic polynomial factoring
Differential Term-Orders
Pourchet's theorem in action: decomposing univariate nonnegative polynomials as sums of five squares
Discrete comprehensive Gröbner bases
A sparse modular GCD algorithm for polynomials over algebraic function fields
Deterministic equation solving over finite fields
Polynomial Systems Arising From Discretizing Systems of Nonlinear Differential Equations
Design and Implementation of Multi-Threaded Algorithms in Polynomial Algebra
CAD Adjacency Computation Using Validated Numerics
Refutational Proofs of Geometry Theorems via Characteristic Set Computation
On the Computation of Ordinary Irreducible Representations of Finite Groups
Hybrid sparse resultant matrices for bivariate systems
Computing Hypergeometric Solutions of Second Order Linear Differential Equations using Quotients of Formal Solutions
Liouvillian solutions of irreducible second order linear difference equations
Closed form solutions of linear odes having elliptic function coefficients
Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm
A Formal Approach to some Usually Informal Techniques Used in Mathematical Reasoning
Computing an LLL-reduced Basis of the Orthogonal Latice
Real root isolation for tame elementary functions
Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing
Further results on the computation of the annihilators of integro-differential operators
Formal Methods in Delay-Differential Equations
Automatic generation of polynomial loop
Deciding Linear Disjointness of Finitely Generated Fields
A refined denominator bounding algorithm for multivariate linear difference equations
Diagnosing and correcting student's misconceptions in an educational computer algebra system
Effective quantifier elimination for industrial applications
Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation)
Sparse Polynomial Interpolation over Fields with Large or Zero Characteristic
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts
Computing Popov and Hermite Forms of Polynomial Matrices
A fast algorithm for computing the characteristic polynomial of the p-curvature
Beyond Worst-Case Analysis for Root Isolation Algorithms
Parallel Sparse PLUQ Factorization modulo p
Uniform Quantifier Elimination and Constraint Query Processing
Equivariant lattice generators and Markov bases
Computer Algebra Applied to a Solitary Waves Study
Buchberger's algorithm and staggered linear bases
Symbolic-Numerical Computations in the Stability Analyses of Difference Schemes
Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time
Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test
Algorithms for the universal decomposition algebra
Computing the differential Galois group of a parameterized second-order linear differential equation
Generation and optimisation of code using coxeter lattice paths
Computing Special Powers in Finite Fields (extended abstract)
Differential forms in computational algebraic geometry
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
Parallel Fast Möbius (Reed-Muller) Transform and its Implementation with CUDA on GPUs
Investigating the structure of a Lie algebra
On the Sign of a Trigonometric Expression
On solutions of linear functional systems
On reducing a system of equations to a single equation
On the computation of the topology of a non-reduced implicit space curve
Asymptotic Expansions of exp-log Functions
Efficient Integer-Linear Decomposition of Multivariate Polynomials
On Continuity of the Roots of a Parametric Zero Dimensional Multivariate Polynomial Ideal
A disk-based parallel implementation for direct condensation of large permutation modules
Representing and handling mathematical concepts by humans and machines
On the complexity of polynomial matrix computations
Computing super-irreducible forms of systems of linear differential equations via moser-reduction: a new approach
Existence and Uniqueness Theorems for Formal Power Series Solutions of Analytic Differential Systems
An Algebraic-Geometric Method for Computing Zolotarev Polynomials
Relaxed mltiplication using the middle product
The Computation of 1-Loop Contributions in Y.M. Theories with Class III Nonrelativistic Gauges and REDUCE
Complexity issues in bivariate polynomial factorization
A Reduction Approach to Creative Telescoping
An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
Simplification and Optimization Transformations of Chains of Recurrences
Elements of computer-algebraic analysis
Algorithms for computing triangular decompositions of polynomial systems
Solving "Generalized Algebraic Equations"
Symmetry Preserving Interpolation
High Degree Solutions of Low Degree Equations (extended abstract)
Numerical optimization in hybrid symbolic-numeric computation
Optimization Problems over Noncompact Semialgebraic Sets
Algebraic Programming in the APS System
Integration of unspecified functions and families of iterated integrals
Extending the Fundamental Theorem of Linear Programming for Strict Inequalities
A Code Optimization Package for REDUCE
Generalized Characteristic Polynomials
Relaxed p-adic Hensel lifting for algebraic systems
An elementary algorithm for the automatic derivation and proof of tensor product identities via computer algebra
Application of high-precision computing for pricing arithmetic asian options
Symbolic summation with radical expressions
Solving polynomial systems over finite fields: improved analysis of the hybrid approach
Algorithms for Discrete Differential Equations of Order 1
Quantifier Elimination and the Sign Variation Method for Real Root Isolation
Discovering Inequality Conditions in the Analytical Solution of Optimization Problems (Extended Abstract)
How to compute multivariate Pade approximants
Computer Algebra on MIMD Machine
Easy composition of symbolic computation software: a new lingua franca for symbolic computation
Can REDUCE be Run in Parallel?
Numeric Code Optimization in Computer Algebra Systems and Recurrent Relations Technique
Fast Computation of the Roots of Polynomials Over the Ring of Power Series
Black box Frobenius decompositions over small fields
New Sequential and Parallel Algorithms for Generating High Dimension Hecke Algebras Using the Condensation Technique
Integral bases for p-recursive sequences
On the Risch-Norman Integration Method and Its Implementation in MAPLE
On the boolean complexity of real root refinement
Fast Algorithm for Border Bases of Artinian Gorenstein Algebras
The GAP 4 Type System: Organising Algebraic Algorithms
Lie-Bäcklund Symmetries of Coupled Nonlinear Schrödinger Equations
Comparing Different Projection Operators in the Cylindrical Algebraic Decomposition for SMT Solving
A Fixed Point Method for Power Series Computation
Rational solutions of singular linear systems
Computation of the degree of rational maps between curves
Symbolic Integration of Hyperexponential 1-Forms
A generalized class of polynomials that are hard to factor
Constructive Arithmetics in Ore Localizations with Enough Commutativity
Application of Metasystem Transition to Function Inversion and Transformation
Expressing a fraction of two determinants as a determinant
Punctual Hilbert scheme and certified approximate singularities
Open Non-uniform Cylindrical Algebraic Decompositions
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method
Newton's iteration and the sparse Hensel algorithm (Extended Abstract)
Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings
Simplification of surface parametrizations
Efficient Algorithms for Ideal Operations (extended abstract)
The design of Macaulay: a system for computing in algebraic geometry and commutative algebra
Comprehensive Characteristic Decomposition of Parametric Polynomial Systems
Verified error bounds for real solutions of positive-dimensional polynomial systems
Symbolic Manipulation of Integrodifferential Expressions and Factorization of Linear Ordinary Differential Operators over Transcendental Extensions of a Differential Field
The Symbolic Computation of Differential Invariants of Polynomial Vector Field Systems Using Trees
An Algorithm of Constructing the Integral of a Module - an Infinite Dimensional Analog of Gröbner Basis
Solving third order linear differential equations in terms of second order equations
Introduction to max-plus algebra
Multiprocessed parallelism support in ALDOR on SMPs and multicores
Rational simplification modulo a polynomial ideal
Exploring the Geometric Buchberger Algorithm in Integer Programming
An Algorithm for Computing Genera of Ternary and Quaternary Quadratic Forms
Hypergeometric dispersion and the orbit problem
Sub-quadratic time for riemann-roch spaces: case of smooth divisors over nodal plane projective curves
Rational canonical forms and efficient representations of hypergeometric terms
Parallel Polynomial Computations by Recursive Processes
Asymptotically fast algorithms for modern computer algebra
An application of knowledge-base technology in education: a geometry theorem prover
On the geometry and the topology of parametric curves
Efficient projection orders for CAD
Factorization and root-finding for polynomials over division quaternion algebras
A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
Algorithms for near-rings of non-linear transformations
Certified homotopy tracking using the Krawczyk method
Interoperating between computer algebra systems: computing homology of groups with kenzo and GAP
Fast multiplication of large permutations for disk, flash memory and RAM
Working with Real Algebraic Plane Curves in REDUCE the GCUR Package
Structured matrix-based methods for polynomial in-gcd: analysis and comparisons
An algorithm for computing set-theoretic generators of an algebraic variety
Semi-numerical determination of irreducible branches of a reduced space curve
Computation of Catalan's Constant Using Ramanujan's Formula
A Geometrical Decision Algorithm Based on the Gröbner Bases Algorithm
The Algorithm for Calculating Integrals of Hypergeometric Type Functions and Its Realization in REDUCE System
Elimination ideal and bivariate resultant over finite fields
Symbolic-numeric algorithms for computing validated results
Order bounds for C2-finite sequences
Sharp estimates for triangular sets
An implementation of operators for symbolic algebra systems
Polynomial root finding using iterated Eigenvalue computation
Global optimization of polynomials using generalized critical values and sums of squares
Sums of squares of polynomials and their applications
Efficient Generic Quotients Using Exact Arithmetic
Calcium: Computing in Exact Real and Complex Fields
Reexamining Intractability of Tableau Methods
Computer algebra in the undergraduate mathematics classroom
Algorithms for symmetrical polynomials
An Algorithm for Symbolic Computation of Center Manifolds
A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations
Locating real multiple zeros of a real interval polynomial
A Fast Deterministic Algorithm for Factoring Polynomials over Finite Fields of Small Characteristic
Generating symmetric DFTs and equivariant FFT algorithms
The Structure of Sparse Resultant Matrices
Approximate multivariate polynomial factorization based on zero-sum relations
A draft description of the group theory language Cayley
Sparse Multiplication of Multivariate Linear Differential Operators
Symbolic Analysis of Planar Drawings
Computing µ-bases of rational curves and surfaces using polynomial matrix factorization
Hermite Reduction for D-finite Functions via Integral Bases
Syzygies of ideals of polynomial rings over principal ideal domains
Multithreaded programming in Cilk
A Parallel Implementation of the Cylindrical Algebraic Decomposition Algorithm
A term rewriting system for the calculus of moving surfaces
Efficient Algorithms for Hankel Matrices over Z[x 1 , ..., x r ]
Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings
Computing Tropical Prevarieties in Parallel
Polynomial Time Algorithms for Modules over Finite Dimensional Algebras
Solving Puzzles Related to Permutation Groups
Algorithmic averaging for studying periodic orbits of planar differential systems
Parallel Lattice Basis Reduction
LinBox and future high performance computer algebra
Real root-finding
Maximum likelihood for matrices with rank constraints
Symbolic-interval cooperation in constraint programming
Advanced notations in Mathematica
The Modulo N Extended GCD Problem for Polynomials
Formulation of design rules for NMR imaging coil by using symbolic manipulation
Unlabeled Sensing Using Rank-One Moment Matrix Completion
On the Implementation of Dynamic Evaluation
Complexity and Uniformity of Elimination in Presburger Arithmetic
A numerical code generation facility for REDUCE
Computing closed form solutions of integrable connections
PAC: First Experiments on a 128 Transputers Méganode
Real Root Finding for Rank Defects in Linear Hankel Matrices
On Algebraic Solutions of First Order Riccatti Equation
Simultaneously row- and column-reduced higher-order linear differential systems
The Evaluation of Integrals and Series with Respect to Indices (Parameters) of Hypergeometric Functions
Symbolic computation of multidimensional Fenchel conjugates
Structural Preprocessing Method for Nonlinear Differential-Algebraic Equations Using Linear Symbolic Matrices
High performance computing: the software challenges
Computing Presentations for Subgroups of Context-Free Groups
Adaptive loops with kaapi on multicore and grid: applications in symmetric cryptography
A New Algorithm for the Geometric Decomposition of a Variety
Numerical equality tests for rational maps and signatures of curves
Toric border basis
Canonical comprehensive Gröbner bases
On p-Adic Differential Equations with Separation of Variables
Symbolic-numeric computation of implicit riquier bases for PDE
Finite Gröbner Bases in Non-Noetherian Skew Polynomial Rings