yusuke1997/dblp-id-title huggingface dataset:
Sparse Rational Univariate Representation
Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems
MPP: A Framework for Distributed Polynomial Computations
Approximate GCD by bernstein basis, and its applications
On factorization of multivariate polynomials over algebraic number and function fields
A Random Base Change Algorithm for Permutation Groups
A Fine-Grained Parallel Completion Procedure
Stability Analysis of Difference Schemes by the Catastrophe Theory Methods and by Means of Computer Algebra
An Algorithm for Computing the Formal Solutions of Differential Systems in the Neighborhood of an Irregular Singular Point
Enlarging the REDUCE domain of computation
International Symposium on Symbolic and Algebraic Computation, ISSAC'13, Boston, MA, USA, June 26-29, 2013
An Algebraic Model for the Parallel Interpretation of Equationally Defined Functions (abstract)
Desingularization of Linear Difference Operators with Polynomial Coefficients
Randomized detection of extraneous factors
Symmetric and semisymmetric graphs construction using G-graphs
A semantic matcher for computer algebra
An Embedding Algorithm for Algebraic Congruence Function Fields
An automatic parallelization framework for algebraic computation systems
The Singular Value Decomposition for Polynomial Systems
Easy Numbers for the Elliptic Curve Primality Proving Algorithm
A polynomial time algorithm for computing the HNF of a module over the integers of a number field
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, ISSAC '89, Portland, Oregon, USA, July 17-19, 1989
Verification of Non-Identities in Algebras
Geometry Theorem Proving in Vector Spaces by Means of Gröbner Bases
Sum of roots with positive real parts
On Realizing Differential-Algebraic Equations by Rational Dynamical Systems
Computations with Parametric Equations
Domains and expressions: an interface between two approaches to computer algebra
GENCRAY: A Portable Code Generator for Cray Fortran
Yet another practical implementation of polynomial factorization over finite fields
Polynomial Equivalence Problems for Sum of Affine Powers
Verification and synthesis using real quantifier elimination
Equations in Words
Approximate GCDs of polynomials and SOS relaxation
Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication
Nonassociative structures on polynomial algebras arising from bio-operations on formal languages: an application of computer algebra to nonassociative systems
Principal intersection and bernstein-sato polynomial of an affine variety
Computing the multiplicity structure in solving polynomial systems
The complete root classification of a parametric polynomial on an interval
High performance implementation of the TFT
Approximate factorization of multivariate polynomials via differential equations
Computing with Arithmetic Groups
An approach to automatic asymptotic expansions
A rational decomposition-lemma for systems of linear differential-algebraic equations
Differential Equations for Feynman Integrals
Qualitative Reasoning, Dimensional Analysis and Computer Algebra
On the Reduction of Linear Systems of Difference Equations
Interfacing mathemagix with C++
The General Solution of an Ordinary Differential Equation
Exploiting fast hardware floating point in high precision computation
Computing with Matrix Groups Using Permutation Representations
An Algorithm for the Computation of Normal Forms and Invariant Manifolds
Recursive programming through table look-up
Computing Real Roots of Real Polynomials ... and now For Real!
Cayley Factorization
On Hensel Construction of Eigenvalues and Eigenvectors of Matrices with Polynomial Entries
Nonlinear Polynomials, Interpolants and Invariant Generation for System Analysis
Computing Gröbner Bases in Monoid and Group Rings
Practical Gröbner basis computation
Computation of discrete comprehensive Gröbner bases using modular dynamic evaluation
The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds
Compact Formulae in Sparse Elimination
Fast algorithms for polynomial solutions of linear differential equations
Improved Sparse Multivariate Polynomial Interpolation Algorithms
Structure of Polyzetas and Explicit Representation on Transcendence Bases of Shuffle and Stuffle Algebras
Fast practical algorithms for the Boolean-product-witness-matrix problem
Perturbation calculations for the spin up problem using REDUCE
Sparse multiplication for skew polynomials
An iterative method for calculating approximate GCD of univariate polynomials
Solving Algebraic Systems which Arise as Necessary Integrability Conditions for Polynomial-Nonlinear Evolution Equations
Solutions of polynomial systems derived from the steady cavity flow problem
Generalized Gröbner Bases and New Properties of Multivariate Difference Dimension Polynomials
Nonlinear Evolution Equations and the Painlevé Analysis: A Constructive Approach with REDUCE
Simplification of Truth-Invariant Cylindrical Algebraic Decompositions
Constructive solid geometry: a symbolic computation approach
Data-Discriminants of Likelihood Equations
On Exact Polya and Putinar's Representations
Random polynomials and expected complexity of bisection methods for real solving
Power series, Bieberbach conjecture and the de Branges and Weinstein functions
Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm
A New Method for Computing Elimination Ideals of Likelihood Equations
Lower bounds for zero-dimensional projections
New Developments of Mathematics Mechanization
On Moment Problems with Holonomic Functions
Separability Problems in Creative Telescoping
On propagation of equational constraints in CAD-based quantifier elimination
Decomposing a Permutation into a Conjugated Tensor Product
Algorithms for Simultaneous Padé Approximations
Parallel Summation in P-Recursive Extensions
Near optimal tree size bounds on a simple real root isolation algorithm
On the Bit Complexity of Solving Bilinear Polynomial Systems
A new algorithm for computing comprehensive Gröbner systems
Software Components Using Symbolic Computation for Problem Solving Environments
Solving recurrence relations using local invariants
Modular dynamic evaluation
Solving second order linear differential equations with Klein's theorem
Numeric-symbolic exact rational linear system solver
Green's Functions for Stieltjes Boundary Problems
Desingularization explains order-degree curves for ore operators
Hyperexponential solutions of finite-rank ideals in orthogonal ore rings
Encounters in Symbolic Computation: Ideas for the Ages
Biased tadpoles: a fast algorithm for centralizers in large matrix groups
NODES: Non Linear Ordinary Differential Equations Solver
Fast Numerical Improvement of Factors of Polynomials and of Partial Fractions
On implementing Buchberger's algorithm for Grobner bases
Proceedings of the International Workshop on Parallel Symbolic Computation, PASCO@ISSAC 2017, Kaiserslautern, Germany, July 23-24, 2017
Optical Character Recognition for Typeset Mathematics
Embedding the Virtual Substitution Method in the Model Constructing Satisfiability Calculus Framework
Polynomials over Finite Fields with Large Images
The Matrix Editor for Symbolic Jacobians in ALPAL
On the Worst-case Complexity of Integer Gaussian Elimination
Discriminants of Complete Intersection Space Curves
Symbolic summation with single-nested sum extensions
An Algorithm to Enumerate Grid Signed Permutation Classes
Solving linear ordinary differential systems in hyperexponential extensions
Online order basis algorithm and its impact on the block Wiedemann algorithm
Fourth order linear differential equations with imprimitive group
A complete symbolic-numeric linear method for camera pose determination
Computers in the study of Lie algebras
Implementing a polynomial factorization and GCD package
The Analytic Continuation Process: From Computer Algebra to Numerical Analysis
An Elementary Algorithm for Computing the Composition Factors of a Permutation Group
Modular techniques for effective localization and double ideal quotient
The Design of a User Interface to a Computer Algebra System for Introductory Calculus
A system for manipulating polynomials given by straight-line programs
New results for random determination of equivalence of expressions
On the Problem of Separating Variables in Multivariate Polynomial Ideals
Quantifier Elimination for Formulas Constrained by Quadratic Equations
Border basis representation of a general quotient algebra
Determinantal formula for the chow form of a toric surface
Computational communicative algebra
An improved algorithm for the resolution of singularities
Algebraic Extensions and Algebraic Closure in Scratchpad II
Improved projection for CAD's of R 3
A Practical Method for the Sparse Resultant
Greater Easy Common Divisor and Standard Basis Completion Algorithms
Selecting Algorithms for Black Box Matrices: Checking For Matrix Properties That Can Simplify Computations
Transformation and factorization of partial differential systems: applications to stochastic systems
Interval arithmetic applied to polynomial remainder sequences
Multivariate difference-differential dimension polynomials and new invariants of difference-differential field extensions
The complexity of quantifier elimination and cylindrical algebraic decomposition
Efficiently Computing Real Roots of Sparse Polynomials
Quantifier Elimination for Real Algebra - the Cubic Case
Computations modulo regular chains
Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings
Computing Valuations of the Dieudonné Determinants
Separating variables in bivariate polynomial ideals
ZpL: a p-adic Precision Package
A fast carry-free algorithm and hardware design for extended integer GCD computation
Non-associative gröbner bases, finitely-presented lie rings and the engel condition
Computing rational solutions of linear matrix inequalities
A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
Note on Theorem Proving Strategies for Resolution Counterparts of Non-Classical Logics
On Rank Properties of Toeplitz Matrices over Finite Fields
An algorithm for finding symmetric Grobner bases in infinite dimensional rings
Dynamic Maintenance of Paths and Path Expressions on Graphs
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, ISSAC '96, Zurich, Switzerland, July 24-26, 1996
A Toolbox for Program Manipulation and Efficient Code Generation with an Application to a Problem in Computer Vision
Rado Numbers and SAT Computations
Resultants of skewly composed polynomials
Generic Reductions for In-place Polynomial Multiplication
Practical Factorization of Univariate Polynomials over Finite Fields
Solving Systems of Bivariate Algebraic Equations by Using Primitive Polynomial Remainder Sequences
Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions
Automated Theorem Proving in Support of Computer Algebra: Symbolic Definite Integration as a Case Study
Deciding Cuspidality of Manipulators through Computer Algebra and Algorithms in Real Algebraic Geometry
Sparse Matrices Powering Three Pillars of Science: Simulation, Data, and Learning
Reduction of Transcendental Decision Problems over the Reals
A Factorization Algorithm for G-Algebras and Applications
The number of decomposable univariate polynomials. extended abstract
Critical-pair criteria for the Knuth-Bendix completion procedure
Radical solutions of first order autonomous algebraic ordinary differential equations
Simplication of Symbolic-Numerical Interval Expressions
Algorithms for recognizing coordinates in two variables over UFD's
Finer Complexity Estimates for the Change of Ordering of Gröbner Bases for Generic Symmetric Determinantal Ideals
Integration of Liouvillian functions with special functions
Border basis detection is NP-complete
Efficient Decision Procedures for Locally Finite Theories II
On the Computational Complexity of the Resolution of Plane Curve Singularities
A modular GCD algorithm over number fields presented with multiple extensions
An Approach for Floating-Point Error Analysis Using Computer Algebra
Numerical parameterization of affine varieties using
Lazy Hermite Reduction and Creative Telescoping for Algebraic Functions
On systems of algebraic equations with parametric exponents
Fast Reduction of the Risch Differential Equation
Factoring Polynomials over Algebraic Number Fields via Norms
Loewy decomposition of linear differential equations
Applications of a software interconnection system in mathematical problem solving environments
Algorithmic Verification of Linearizability for Ordinary Differential Equations
Initial Application of SONC to Lyapunov Stability of Dynamical Systems
Logspace computations in graph products
Computing the invariant structure of integer matrices: fast algorithms into practice
Toric ideals of homogeneous phylogenetic models
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023
Computation for conductance distributions of percolation lattice cells
High-order lifting
Root counts of semi-mixed systems, and an application to counting nash equilibria
Unimodular completion of polynomial matrices
Computing a Basis for an Integer Lattice: A Special Case
Towards approximations which preserve integrals
A Symplectic Kovacic's Algorithm in Dimension 4
Validated Root Enclosures for Interval Polynomials with Multiplicities
Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety
Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
A Parallelization of the Buchberger Algorithm
Linear Algebra for Zero-Dimensional Ideals
The computer algebra system CAS1 for the IBM-PC
Towards certified irreducibility testing of bivariate approximate polynomials
Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation co-located with the 42nd International Symposium on Symbolic and Algebraic Computation (ISSAC 2017), Kaiserslautern, Germany, July 29, 2017
Liouvillian Solutions of Third Order Differential Equations
Star Products and the Representation of Asymptotic Growth
Deciding polynomial-exponential problems
On the Complexity of Computing Real Radicals of Polynomial Systems
A Combined Symbolic/Numeric Approach for the Integration of Stiff Nonlinear Systems of ODE's
PRECOMAS an Implementation of Constructive Matching Methodology
On Stability Analysis of Linear Stochastic and Time-Varying Deterministic Systems
Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem
Decoding Simultaneous Rational Evaluation Codes
Multiple GCDs. probabilistic analysis of the plain algorithm
Rank reduction of a class of pfaffian systems in two variables
A generic projection operator for partial cylindrical algebraic decomposition
Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures
Solvability by radicals from an algorithmic point of view
Arithmetic with Real Algebraic Numbers is in NC
Absolute polynomial factorization in two variables and the knapsack problem
Computing Krylov iterates in the time of matrix multiplication
Modeling Complex Root Motion of Real Random Polynomials under Differentiation
Applications of Computer Algebra to Parameter Analysis of Dynamical Systems
Computations with Algebraic Curves
A Heuristic Selection Strategy for Lexicographic Gröbner Bases?
Computing with semi-algebraic sets represented by triangular decomposition
A Zero Structure Theorem for Exponential Polynomials
An algorithm for the eigenvalue perturbation problem: reduction of a -matrix to a Lidskii matrix
Gröbner bases: a sampler of recent developments
Gröbner Bases Over Tate Algebras
Approximate polynomial decomposition
Order-Degree-Height Surfaces for Linear Operators
Building Bridges between Symbolic Computation and Satisfiability Checking
Polynomial real root isolation by differentiation
Parametrizations for Families of ECM-Friendly Curves
On the Genericity of the Modular Polynomial GCD Algorithm
New progress in univariate polynomial root finding
An algorithm to compute the differential equations for the logarithm of a polynomial
When does ( T ) equal sat( T )?
On the uniqueness of simultaneous rational function reconstruction
Isolating real roots of real polynomials
Design and Protocol for Internet Accessible Mathematical Computation
Automatic synthesis of high performance mathematical programs
Series Solutions of Algebraic and Differential Equations: A Comparison of Linear and Quadratic Algebraic Convergence
Operating Computer Algebra Systems by Handprinted Input
Reduction and Completion Algorithms for Partial Differential Equations
On FGLM Algorithms with Tate Algebras
Decomposition of *-closed Algebras in Polynomial Time
Algebraic computation for the masses
Formulas for Continued Fractions: An Automated Guess and Prove Approach
Two New Ways to Formally Prove Dandelin-Gallucci's Theorem
Exact computations with quasiseparable matrices
Computation of minimal generators of ideals of fat points
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, ISSAC 2000, St. Andrews, United Kingdom, August 6-10, 2000
Fast Computation of the Smith Normal Form of an Integer Matrix
Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations
P-adic Constraint Solving
Signature Gröbner bases in free algebras over rings
Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences
Some Results on the Defect
Fast High-Resolution Drawing of Algebraic Curves
Approximate rational solutions torational ODEs defined on discrete differentiable curves
The Gröbner basis of a module over KUX1, ..., Xne and polynomial solutions of a system of linear equations
Schur partition for symmetric ternary forms and readable proof to inequalities
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, ISSAC '93, Kiev, Ukraine, July 6-8, 1993
Experiments with a Projection Operator for Algebraic Decomposition
Sparse Polynomial Hermite Interpolation
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ISSAC '99, Vancouver, B.C., Canada, July 29-31, 1999
Two Fast Parallel GCD Algorithms of Many Integers
On the Castelnuovo Regularity for Curves
Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting
On lacunary polynomial perfect powers
Fast Multiplication for Skew Polynomials
On the Isomorphism Problem for Finite-Dimensional Binomial Algebras
A New Algorithm for Computing Symbolic Limits Using Hierarchical Series
Matrix-F5 Algorithms and Tropical Gröbner Bases Computation
Rational parametrisation for degree 6 Del Pezzo surfaces using lie algebras
Liouvillian solutions of irreducible linear difference equations
An Application of IRENA to Systems of Nonlinear Equations Arising in Equilibrium Flows in Networks.
Sylvester-resultants for bivariate polynomials with planar newton polygons
Power series solutions for non-linear PDE's
Sparsity issues in the computation of Jacobian matrices
On a parallel Lehmer-Euclid GCD algorithm
How to Compute the Melnikov Vector?
Verification methods: rigorous results using floating-point arithmetic
Qualitative analysis of mathematical expressions using computer symbolic mathematics
An alternative approach to comprehensive Gröbner bases
Efficient matrix rank computation with application to the study of strongly regular graphs
Mixed Real-Integer Linear Quantifier Elimination
An Application of the REDUCE System for Solving a Mathematical Geodesy Problem
Maximum likelihood geometry in the presence of data zeros
Gröbner bases of toric ideals and their application
Enumerating Denumerable Sets in Polynomial Time via the Schröder-Bernstein Theorem
Rational Solutions of First Order Linear Difference Systems
Sum of Squares Bounds for the Empty Integral Hull Problem
The MACSYMA "big-floating-point" arithmetic system
Numerical Uniformization of Hyperelliptic Curves
An O ( n 3 ) Algorithm for the Frobenius Normal Form
Embedding Integer Lattices as Ideals into Polynomial Rings
Signature-based algorithms for Gröbner bases over tate algebras
Parallel Univariate p -adic Lifting on Shared-Memory Multiprocessors
An object-oriented approach to algebra system design
Finding Relations Among the Roots of an Irreducible Polynomial
Big Prime Field FFT on the GPU
Improving the accuracy of linear programming solvers with iterative refinement
A Method for the Integration of Solutions of Ore Equations
On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract)
Gröbner Bases of Ideals Given by Dual Bases
Computation of the (n-1)-st Koszul Homology of monomialideals and related algorithms
Features of Symbolic Computation Exploited in the Calculation of Lower Energy Bounds of Cyclic Polyene Models
Diversification improves interpolation
A skew polynomial approach to integro-differential operators
Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation
Applying Rewriting Techniques to Groups with Power-Communication-Presentations
MINION: An Environment to Organize Mathematical Problem Solving
On Liouvillian solutions of linear differential equations of order 4 and 5
Efficient ECM factorization in parallel with the lyness map
Rectangular corner cutting and Sylvester A-resultants
Lattices with symmetry
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC '92, Berkeley, CA, USA, July 27-29, 1992
SIMATH - a Computer Algebra System for Number Theoretic Applications
The solution of s exp( s ) = a is not always the lambert w function of a
Hyperelliptic Integrals to Elliptic Integrals
Simplification of radical expressions
Geometric modeling and regularization of algebraic problems
Systematic Computer-Aided Analysis of Dynamic Systems
Computations Involving Differential Operators and Their Actions on Functions
A Package for Computations in Simple Lie Algebra Representations
Space- and time-efficient polynomial multiplication
Local quantifier elimination
Advances and Trends in the Design and Construction of Algebraic Manipulation Systems
On isomorphisms of modules over non-commutative PID
On Determining the Solvability of Polynomials
On fast multiplication of a matrix by its transpose
Computing a structured Gröbner basis approximately
Output-sensitive decoding for redundant residue systems
An Improvement of the Projection Operator in Cylindrical Algebraic Decomposition
Calculating the Power Residue Symbol and Ibeta: Applications of Computing the Group Structure of the Principal Units of a p-adic Number Field Completion
Signature Functions for Algebraic Numbers
Fast simplifications for Tarski formulas
Power series and linear difference equations
Symbolic Summation in Difference Rings and Applications
Computer understanding and generalization of symbolic mathematical calculations: a case study in physics problem solving
Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbers
Algebra-Based Loop Analysis
Black box methods for least squares problems
Global optimization via the dual SONC cone and linear programming
Specifying Implementations
Whitney Stratification of Algebraic Boundaries of Convex Semi-algebraic Sets
Hybrid symbolic-numeric computation
On the Computation of Conjugacy Classes in Permutation Groups
Computing Canonical Bases of Modules of Univariate Relations
Decomposition of generic multivariate polynomials
Application of numerical algebraic geometry and numerical linear algebra to PDE
On Bivariate Hensel and Its Parallelization
Deterministic unimodularity certification
Computing Hermite Normal Form Faster via Solving System of Linear Equations
A speed-up of the algorithm for computing comprehensive Gröbner systems