Counting and Gröbner bases

DOI10.1006/jsco.2000.1575zbMath0970.68200OpenAlexW2031104875MaRDI QIDQ5929708

No author found.

Publication date: 16 April 2001

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0da69e14d6560900200931dc5ca4035dc010d926

zbMATH Keywords

Gröbner bases

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Model checking in the modal \(\mu \)-calculus and generic solutions

Cites Work

• A theorem on refining division orders by the reverse lexicographic order
• The complexity of linear problems in fields
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• On the intrinsic complexity of elimination theory
• Converting bases with the Gröbner walk
• The complexity of the word problems for commutative semigroups and polynomial ideals
• A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
• The Complexity of Enumeration and Reliability Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item