Hilbert function and complexity lower bounds for symmetric Boolean functions

DOI10.1006/inco.1999.2798zbMath1004.06013OpenAlexW2038934930MaRDI QIDQ1854301

Lavinia Egidi, Anna Bernasconi

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/482feaaec79ee7c5dea2930ea63313cbc38f73c3

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30)

Related Items (4)

Covering symmetric sets of the Boolean cube by affine hyperplanes ⋮ Algebraic Properties of ModuloqComplete ℓ-Wide Families ⋮ Some Combinatorial Applications of Gröbner Bases ⋮ Gröbner bases for complete uniform families

Uses Software

• Macaulay2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hilbert function and complexity lower bounds for symmetric Boolean functions