Pages that link to "Item:Q2802384"
From MaRDI portal
The following pages link to ACM Communications in Computer Algebra (Q2802384):
Displaying 50 items.
- Cheater identification on a secret sharing scheme using GCD (Q5175296) (← links)
- A saturation algorithm for homogeneous binomial ideals (Q5175297) (← links)
- An algebraic framework for extending orthogonal designs (Q5175298) (← links)
- An automatic parallelization framework for OpenAxiom (Q5175299) (← links)
- Solving bivariate polynomial systems on a GPU (Q5175300) (← links)
- Inverting matrices modulo regular chains (Q5175301) (← links)
- Isolated real zero of a real polynomial system under perturbation (Q5175302) (← links)
- Integration in finite terms of non-liouvillian functions (Q5175303) (← links)
- Using resultants for inductive Gröbner bases computation (Q5175304) (← links)
- Gröbner bases and generalized sylvester matrices (Q5175306) (← links)
- New approaches to boolean quantifier elimination (Q5175308) (← links)
- Boolean Gröbner bases in SAT solving (Q5175309) (← links)
- On Buchberger's method of solving systems of algebraic equations (Q5175310) (← links)
- Computing the real solutions of polynomial systems with the RegularChains library in Maple (Q5175311) (← links)
- Simplicial blowups and discrete normal surfaces in simpcomp (Q5175313) (← links)
- Defect polytopes and counter-examples with polymake (Q5175314) (← links)
- Software for computing the Gröbner cover of a parametric ideal (Q5175315) (← links)
- New software for computing asymptotics of multivariate generating functions (Q5175316) (← links)
- Mathemagix (Q5175317) (← links)
- A symbolic framework for general polynomial domains in theorema (Q5175318) (← links)
- A computational view on normal forms of matrices of Ore polynomials (Q5175319) (← links)
- Ways to implement computer algebra compactly (Q5175320) (← links)
- Open source computer algebra systems (Q5175323) (← links)
- Testing linear dependence of hyperexponential elements (Q5175695) (← links)
- Useful computations need useful numbers (Q5175696) (← links)
- Irreducible polynomials and barker sequences (Q5175697) (← links)
- On a query algorithm for a divisibility problem (Q5175698) (← links)
- Reasoning in symbolic computation (Q5175699) (← links)
- In Memoriam Eugeny Pankratiev (Q5175700) (← links)
- ACM 2007 Kanellakis Award Honours Bruno Buchberger Innovator of Automated Tools for Mathematics (Q5175701) (← links)
- Open source computer algebra systems (Q5175702) (← links)
- (abstract only) (Q5175703) (← links)
- Small algorithms for small systems (Q5176431) (← links)
- James Griesmer 1929--2011 (Q5176432) (← links)
- Farewell to "W" (Herbert Saul Wilf), a true VISIONARY for whom EVERYTHING was INTERTWINED (Q5176433) (← links)
- Series crimes (Q5176434) (← links)
- In Memoriam (Q5176435) (← links)
- A repository for CAD examples (Q5176436) (← links)
- Stefan Dodunekov 1945--2012 (Q5176437) (← links)
- Series misdemeanors (Q5176438) (← links)
- Improving incremental signature-based Gröbner basis algorithms (Q5176439) (← links)
- Remembering Richard Crandall (1947--2012) (Q5176440) (← links)
- Simplifying products of fractional powers of powers (Q5176441) (← links)
- Review of "a first course in computational algebraic geometry" by W. Decker and G. Pfister (Q5176442) (← links)
- Asymptotic series of generalized Lambert W function (Q5176443) (← links)
- The computational geometry algorithms library CGAL (Q5176444) (← links)
- Implementation of a solution to the conjugacy problem in Thompson's group F (Q5176446) (← links)
- Modified gauss algorithm for matrices with symbolic entries (Q5176447) (← links)
- The F5 criterion revised (Q5176448) (← links)
- KNOPPIX/Math (Q5176450) (← links)
