scientific article; zbMATH DE number 7166711
From MaRDI portal
Publication:5215664
DOI10.4086/TOC.2019.V015A017zbMATH Open1494.68085arXiv1702.03625OpenAlexW2594003820MaRDI QIDQ5215664FDOQ5215664
Authors: Ben Rossman, Srikanth Srinivasan 
Publication date: 12 February 2020
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.03625
Title of this publication is not available (Why is that?)
Recommendations
- Separation of \(\mathrm{AC}^0[\oplus]\) formulas and circuits
- Separation of multilinear circuit and formula size
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- Certifying polynomials for AC^0(parity) circuits, with applications
- Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
- Separable Laplace equation, magic Toeplitz matrix, and generalized Ohm's law
- Separating AC\(^0\) from depth-2 majority circuits
- Circuit separation for symmetric matroids
- On an Integral Transformation of General Circuit Theory
Cited In (10)
- Separation of \(\mathrm{AC}^0[\oplus]\) formulas and circuits
- On polynomial approximations to \(\mathrm{AC}^0\)
- Degree lower bounds of tower-type for approximating formulas with parity quantifiers
- Monotone separations for constant degree polynomials
- Separating AC\(^0\) from depth-2 majority circuits
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression
- Bounds on the Size of Small Depth Circuits for Approximating Majority
- Degree lower bounds of tower-type for approximating formulas with parity quantifiers
- Separability and reducibility criteria of RLC networks overFz and their applications
- Optimal explicit small-depth formulas for the coin problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215664)
