On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions

DOI10.1007/978-3-030-43662-9_17OpenAlexW2785372123MaRDI QIDQ5098782

Oded Goldreich, Avishay Tal

Publication date: 30 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43662-9_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Boolean function complexity. Advances and frontiers.
• Three XOR-Lemmas — An Exposition
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Simple Constructions of Almost k-wise Independent Random Variables
• On ε‐biased generators in NC⁰

This page was built for publication: On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions