Upper bound for torus polynomials
From MaRDI portal
Publication:2117095
DOI10.1007/978-3-030-79416-3_15OpenAlexW3177479387MaRDI QIDQ2117095FDOQ2117095
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_15
Recommendations
- Pursuing polynomial bounds on torsion
- scientific article; zbMATH DE number 3990390
- scientific article; zbMATH DE number 7559056
- An upper bound on Jacobi polynomials
- scientific article; zbMATH DE number 2058613
- A polynomial Sárközy-Furstenberg theorem with upper bounds
- Upper bounds of Schubert polynomials
- scientific article; zbMATH DE number 6807852
- Upper bounds of topology of complex polynomials in two variables
- An upper bound for the Laguerre polynomials
Cites Work
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Parity, circuits, and the polynomial-time hierarchy
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Nonuniform ACC Circuit Lower Bounds
- Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP
- New algorithms and lower bounds for circuits with linear threshold gates
- Title not available (Why is that?)
- Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
- An average-case lower bound against \(\mathsf{ACC}^0\)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
Cited In (3)
This page was built for publication: Upper bound for torus polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117095)
