Pages that link to "Item:Q1836661"
From MaRDI portal
The following pages link to The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661):
Displaying 50 items.
- Complexity bounds in elimination theory -- a survey. (Q1565824) (← links)
- Algorithms for residues and Łojasiewicz exponents (Q1585067) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Polynomial ideals for sandpiles and their Gröbner bases (Q1605301) (← links)
- A Pommaret bases approach to the degree of a polynomial ideal (Q1656829) (← links)
- Primary components of codimension two lattice basis ideals (Q1684291) (← links)
- Complexity of some language fragments of fuzzy logics (Q1699732) (← links)
- Local zero estimates and effective division in rings of algebraic power series (Q1707509) (← links)
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\) (Q1725693) (← links)
- A generic effective Nullstellensatz (Q1774958) (← links)
- Algebraic algorithms for sampling from conditional distributions (Q1807063) (← links)
- Triangular sets for solving polynomial systems: a comparative implementation of four methods (Q1808665) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- Gröbner bases of toric varieties (Q1812964) (← links)
- A multiparameter analysis of the boundedness problem for vector addition systems (Q1819938) (← links)
- Projections of vector addition system reachability sets are semilinear (Q1823697) (← links)
- Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (Q1854344) (← links)
- Computing a context-free grammar-generating series (Q1854451) (← links)
- A sharp bound for the Castelnuovo-Mumford regularity of subspace arrangements. (Q1865280) (← links)
- On the embedded primes of the Mayr-Meyer ideals (Q1881115) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- Linear logic automata (Q1919766) (← links)
- Binomial ideals (Q1922418) (← links)
- Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties (Q1928235) (← links)
- Fast theorem-proving and Wu's method (Q1966111) (← links)
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals (Q1974694) (← links)
- Dehn functions of finitely presented metabelian groups (Q1983948) (← links)
- Many associated primes of powers of primes (Q2001430) (← links)
- Using machine learning to improve cylindrical algebraic decomposition (Q2009221) (← links)
- Efficiently and effectively recognizing toricity of steady state varieties (Q2035620) (← links)
- Towards massively parallel computations in algebraic geometry (Q2040457) (← links)
- Composable computation in discrete chemical reaction networks (Q2064055) (← links)
- Computation of Macaulay constants and degree bounds for Gröbner bases (Q2066954) (← links)
- Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
- Bounds on the torsion subgroup schemes of Néron-Severi group schemes (Q2089658) (← links)
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols (Q2090128) (← links)
- Efficient localization at a prime ideal without producing unnecessary primary components (Q2103539) (← links)
- Codeterminantal graphs (Q2154283) (← links)
- Integration-by-parts reductions of Feynman integrals using singular and GPI-space (Q2188602) (← links)
- Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294) (← links)
- On the maximal graded shifts of ideals and modules (Q2219004) (← links)
- On some configurations of oppositely charged trapped vortices in the plane (Q2221790) (← links)
- Some issues on the automatic computation of plane envelopes in interactive environments (Q2228804) (← links)
- A bound for a typical differential dimension of systems of linear differential equations (Q2246869) (← links)
- Subadditivity of syzygies of Koszul algebras (Q2255287) (← links)
- A bound for orders in differential Nullstellensatz (Q2267443) (← links)
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
- Dimension and depth dependent upper bounds in polynomial ideal theory (Q2284949) (← links)
- Cylindrical algebraic decomposition with equational constraints (Q2307622) (← links)
- Toward an efficient algorithm for deciding the vanishing of local cohomology modules in prime characteristic (Q2312816) (← links)
