scientific article; zbMATH DE number 7561310
From MaRDI portal
Publication:5090936
DOI10.4230/LIPIcs.FSTTCS.2018.5MaRDI QIDQ5090936
Tulasimohan Molli, Srikanth Srinivasan, Prahladh Harsha, Siddharth Bhandari
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1812.01982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Related Items (2)
On the probabilistic degree of OR over the reals ⋮ On the Probabilistic Degrees of Symmetric Boolean Functions
Cites Work
- Unnamed Item
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- A lower bound for radio broadcast
- Covering the cube by affine hyperplanes
- On deterministic approximation of DNF
- Anti-concentration for polynomials of independent random variables
- Polylogarithmic independence fools AC 0 circuits
- Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
- On polynomial approximations to AC
- On a lemma of Littlewood and Offord
This page was built for publication:
