Skip to main navigation Skip to search Skip to main content

Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions

Research output: Contribution to journalArticlepeer-review

Abstract

This paper explores the application of certain algebraic geometry techniques involving Hilbert functions and Gröbner bases to the analysis of properties of Boolean functions. It gives some results and applications for symmetric functions.

Original languageEnglish
Pages (from-to)1-25
Number of pages25
JournalInformation and Computation
Volume153
Issue number1
DOIs
Publication statusPublished - 25 Aug 1999

Fingerprint

Dive into the research topics of 'Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions'. Together they form a unique fingerprint.

Cite this