Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $

DOI10.1137/S0895480193255505zbMath0841.68064OpenAlexW2097114401MaRDI QIDQ4875435

Shi-Chun Tsai

Publication date: 2 July 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480193255505

zbMATH Keywords

computational complexitycircuit complexityboolean function complexity

Mathematics Subject Classification ID

Related Items (3)

Constructing Ramsey graphs from Boolean function representations ⋮ Hierarchical diagnostic classification models morphing into unidimensional `diagnostic' classification models -- a commentary ⋮ Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols

This page was built for publication: Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $