scientific article; zbMATH DE number 217454

From MaRDI portal
Revision as of 19:06, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4693774

zbMath0772.13010MaRDI QIDQ4693774

Volker Weispfenning, Thomas M. Becker

Publication date: 27 June 1993


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Alexander invariants of complex hyperplane arrangementsAutomatic classification of normal formsPolynomial selection for computing Gröbner basesSymideal Gröbner basesOn the complexity of the integral closureGröbner bases of associative algebras and the Hochschild cohomologyThe affine sieveGröbner bases of neural idealsBuchberger's algorithm: A constraint-based completion procedureGRIN: An implementation of Gröbner bases for integer programmingGroup-like small cancellation theory for ringsThe invertibility of rational univariate representationsA Direttissimo Algorithm for Equidimensional DecompositionEffective algebraic independence of values of \(E\)-functionsIterative roots of two-dimensional mappingsA signature-based algorithm for computing the nondegenerate locus of a polynomial systemWhat Does Qualitative Spatial Knowledge Tell About Origami Geometric Folds?Poisson and symplectic reductions of 4–DOF isotropic oscillators. The van der Waals system as benchmarkModularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic PropertiesA technique to reduce memory usage of M4GB algorithmCup-length of oriented Grassmann manifolds via Gröbner basesAxioms for a theory of signature bases\textsc{Rings}: an efficient Java/Scala library for polynomial ringsA model for analyzing phenomena in multicellular organisms with multivariable polynomials: Polynomial lifeOn the computation of the Galois group of linear difference equationsRelative generalized Hamming weights of evaluation codesUnnamed ItemEffective Algebraic Analysis Approach to Linear Systems over Ore AlgebrasAlgebraic Modelling of Covering ArraysAssociated prime ideals over skew PBW extensionsSkew Poincaré–Birkhoff–Witt extensions over weak compatible ringsNormal Form Analysis of ℤ2-Equivariant SingularitiesIDEALS OF MINORS DEFINING GENERIC SINGULARITIES AND THEIR GRöBNER BASESBasic Module Theory over Non-commutative Rings with Computational Aspects of Operator AlgebrasTime-delay interferometryThurston’s spinning construction and solutions to the hyperbolic gluing equations for closed hyperbolic 3–manifoldsMonomial bases and pre-Lie structure for free Lie algebrasNonlinear Consensus on Networks: Equilibria, Effective Resistance, and Trees of MotifsUsing Galois ideals for computing relative resolventsCounting and Gröbner basesAn implicitization algorithm for rational surfaces with no base pointsTime-delay interferometryIrreducible ideals of finitely generated commutative monoidsGröbner bases over Galois rings with an application to decoding alternant codesA Gröbner free alternative for polynomial system solvingUnnamed ItemAlgebraic structure of quasicyclic codesReparameterization of Curves and Surfaces with Respect to Their ConvolutionA general framework to build contextual cover set induction proversRecognizing the symmetry type of O. D. E. sAn Efficient $$F_4$$ -style Based Algorithm to Solve MQ ProblemsOn the Complexity of Linear Algebra Operations over Algebraic Extension FieldsEffective Algorithm for Computing Noetherian Operators of Positive Dimensional IdealsRe-filtering and exactness of the Gelfand-Kirillov dimensionAn algorithmic approach to Schmüdgen's PositivstellensatzTwo applications of analytic functorsOn the complexity of computing Gröbner bases for weighted homogeneous systemsCylinders Through Five Points: Complex and Real Enumerative GeometryUnnamed ItemUnnamed ItemIdeal membership in polynomial rings over the integersAn algebraic study of multivariable integration and linear substitutionEffective Set Membership in Computer Algebra and BeyondUnnamed ItemGeneralized Integral Dependence RelationsZ 2 -equivariant standard bases for submodules associated with Z 2 -equivariant singularitiesPolynomial selection of <i>F</i><sub>4</sub> for solving the MQ problemEffective approximation of the solutions of algebraic equationsPolly cracker, revisitedOn the complexity of computing Gröbner bases in characteristic 2Simplification of nested real radicals revisitedTesting binomiality of chemical reaction networks using comprehensive Gröbner systemsFirst order perturbation and local stability of parametrized systemsConditions for polynomial Liénard centersRole of involutive criteria in computing Boolean Gröbner basesComputing generating sets of lattice ideals and Markov bases of latticesDecomposition of algebraic sets and applications to weak centers of cubic systemsBlending implicit interval curves and surfacesComputer algebra for guaranteed accuracy. How does it help?Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDsRepresenting and solving finite-domain constraint problems using systems of polynomialsTwo computational techniques for singularity resolutionCommutative algebra in the Mizar systemA new proof for the correctness of the F5 algorithmPolynomial equation solving by lifting procedures for ramified fibersMaximization principles for frequency-dependent selection. II: The one-locus multiallele caseExtended \(F_5\) criteriaGröbner bases for polynomial systems with parametersF5C: A variant of Faugère's F5 algorithm with reduced Gröbner basesInvariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner basesOn the determination of cusp points of 3-RPR parallel manipulatorsFormal Laurent series in several variablesAn improved algorithm for deciding semi-definite polynomialsSymbolic powers of planar point configurations. II.Isochronicity conditions for some planar polynomial systemsArtificial discontinuities of single-parametric Gröbner basesW-Gröbner basis and monomial ideals under polynomial compositionDecomposing polynomial sets into simple sets over finite fields: the zero-dimensional caseA note on determine the greatest common subfamily of two NFSRs by Gröbner basisDiscussion on polynomials having polynomial iterative roots







This page was built for publication: