Upper bound for torus polynomials
From MaRDI portal
Publication:2117095
DOI10.1007/978-3-030-79416-3_15OpenAlexW3177479387MaRDI QIDQ2117095
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_15
Cites Work
- Unnamed Item
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- An average-case lower bound against \(\mathsf{ACC}^0\)
- Nonuniform ACC Circuit Lower Bounds
- Parity, circuits, and the polynomial-time hierarchy
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
- New algorithms and lower bounds for circuits with linear threshold gates
- Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP
- Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
This page was built for publication: Upper bound for torus polynomials
