No. Title Author Year
1 A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates Bajpai, Swapnam et al. 2018
2 A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas Chillara, Suryajith et al. 2018
3 Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds Rajgopal, Ninad et al. 2018
4 Local Decoding and Testing of Polynomials over Grids Srinivasan, Srikanth et al. 2018
5 On the Probabilistic Degree of OR over the Reals Bhandari, Siddharth et al. 2018
6 Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications Chillara, Suryajith et al. 2018
7 Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees Lagarde, Guillaume et al. 2017
8 On Polynomial Approximations Over Z/2^kZ* Bhrushundi, Abhishek et al. 2017
9 Separation of AC^0[oplus] Formulas and Circuits Rossman, Benjamin et al. 2017
10 Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits Chen, Ruiwen et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 17


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI