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

DOI10.1007/BF01294254zbMATH Open0890.68062OpenAlexW2067616141MaRDI QIDQ1377573FDOQ1377573

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

Recommendations

• Representations of sets of Boolean functions by commutative rings
• scientific article
• Certain problems associated with Boolean polynomials

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)

Cites Work

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

Cited In (1)

• Title not available (Why is that?)

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)