Separation of AC^0[] formulas and circuits
From MaRDI portal
Publication:5111381
DOI10.4230/LIPICS.ICALP.2017.50zbMATH Open1441.68046MaRDI QIDQ5111381FDOQ5111381
Authors: Benjamin Rossman, Srikanth Srinivasan 
Publication date: 27 May 2020
Recommendations
- scientific article; zbMATH DE number 7166711
- Certifying polynomials for AC^0(parity) circuits, with applications
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression
- Separating AC\(^0\) from depth-2 majority circuits
- On polynomial approximations to \(\mathrm{AC}^0\)
Cited In (9)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem
- Criticality of regular formulas
- Fourier bounds and pseudorandom generators for product tests
- Parity helps to compute majority
- Separating AC\(^0\) from depth-2 majority circuits
- Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression
- Small-depth multilinear formula lower bounds for iterated matrix multiplication with applications
- Title not available (Why is that?)
This page was built for publication: Separation of \(\mathrm{AC}^0[\oplus]\) formulas and circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111381)
