Reflections on ``Representations of sets of Boolean functions by commutative rings by Roman Smolensky

DOI10.1007/BF01294254MaRDI QIDQ1377573zbMATH OpenOpenAlexFDO

Authors Jehoshua Bruck

Publication date 11 February 1998

Published in Computational Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01294254

zbMATH Keywords

Boolean functionscircuit complexity

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Boolean functions (06E30)

Recommendations

• Representations of sets of Boolean functions by commutative rings
• scientific article; zbMATH DE number 176873
• Certain problems associated with Boolean polynomials

Cites work

• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• Constant depth circuits, Fourier transform, and learnability
• Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
• Harmonic Analysis of Polynomial Threshold Functions
• Learning Decision Trees Using the Fourier Spectrum
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
• Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms
• Representations of sets of Boolean functions by commutative rings

Cited in

(1)

• scientific article; zbMATH DE number 176873 (Why is no real title available?)

This page was built for publication: Reflections on ``Representations of sets of Boolean functions by commutative rings by Roman Smolensky

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377573)