Graver degrees are not polynomially bounded by true circuit degrees
From MaRDI portal
Publication:2259178
Recommendations
- A degree bound for the Graver basis of non-saturated lattices
- Degree 2 Boolean functions on Grassmann graphs
- scientific article; zbMATH DE number 4087710
- Degrees which do not bound minimal degrees
- Some degree bounds for the circumference of graphs
- Graded Betti numbers of some families of circulant graphs
- On the graceful polynomials of a graph
- scientific article; zbMATH DE number 3859168
- Bounds for the degrees in the Nullstellensatz
- Nontriviality of the \(M\)-degree of the \(A\)-polynomial
Cites work
Cited in
(4)
This page was built for publication: Graver degrees are not polynomially bounded by true circuit degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259178)