A polynomial restriction lemma with applications
From MaRDI portal
(Redirected from Publication:4978008)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Recommendations
- A lemma on polynomials and its applications.
- Some applications of the boundary Schwarz lemma for polynomials with restricted zeros
- Inequalities for polynomials with restricted coefficients
- A property of polynomials with an application to Siegel's lemma
- On a polynomial lemma of Andrievskii
- Some inequalities for polynomials with restricted zeros
- A polynomial Hutton theorem with applications
- ASYMPTOTIC INEQUALITIES FOR POLYNOMIALS WITH RESTRICTED COEFFICIENTS
- Remarks on some recent results about polynomials with restricted zeros
- scientific article; zbMATH DE number 3878409
Cited in
(10)- The Littlewood-Offord problem for Markov chains
- A \#SAT algorithm for small constant-depth circuits with PTF gates
- A polynomial Hutton theorem with applications
- Polynomial threshold functions and Boolean threshold circuits
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity
- A regularity lemma and low-weight approximators for low-degree polynomial threshold functions
- Satisfiability and derandomization for small polynomial threshold circuits
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization
- A \#SAT algorithm for small constant-depth circuits with PTF gates
- A lemma on polynomials and its applications.
This page was built for publication: A polynomial restriction lemma with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978008)
