scientific article; zbMATH DE number 7204253
From MaRDI portal
Publication:5111132
DOI10.4230/LIPIcs.CCC.2017.2zbMath1440.68105MaRDI QIDQ5111132
Massimo Lauria, Jakob Nordström
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (2)
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares ⋮ Proof Complexity Meets Algebra
Uses Software
This page was built for publication:
