Counting and Gröbner bases (Q5929708)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 1586402

Language	Label	Description	Also known as
English	Counting and Gröbner bases	scientific article; zbMATH DE number 1586402

Statements

scholarly article

0 references

Counting and Gröbner bases (English)

0 references

Journal of Symbolic Computation

0 references

publication date

16 April 2001

0 references

full work available at URL

https://semanticscholar.org/paper/0da69e14d6560900200931dc5ca4035dc010d926

0 references

zbMATH Keywords

Gröbner bases

0 references

MaRDI profile type

MaRDI publication profile

0 references

A theorem on refining division orders by the reverse lexicographic order

0 references

0 references

0 references

Converting bases with the Gröbner walk

0 references

0 references

0 references

Efficient computation of zero-dimensional Gröbner bases by change of ordering

0 references

On the intrinsic complexity of elimination theory

0 references

A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems

0 references

0 references

The complexity of the word problems for commutative semigroups and polynomial ideals

0 references

0 references

0 references

The Complexity of Enumeration and Reliability Problems

0 references

The complexity of linear problems in fields

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1006/JSCO.2000.1575

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5929708

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5929708&oldid=38270934"