Algorithmic Polynomials
From MaRDI portal
Recommendations
- Algorithmic polynomials
- scientific article; zbMATH DE number 1296286
- Polynomial algorithms in computer algebra
- Algorithms for polynomials in two variables
- Polynomial decomposition algorithms
- Polynomial decomposition algorithms
- Algorithmic properties of polynomial rings
- scientific article; zbMATH DE number 4092769
- Algorithms related to the decomposition of polynomials
Cites work
- A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)
- A note on quantum algorithms and the minimal degree of -error polynomials for symmetric functions
- Adversary lower bound for the k-sum problem
- Agnostically Learning Halfspaces
- Any AND-OR formula of size \(N\) can be evaluated in time \(N^{1/2+o(1)}\) on a quantum computer
- Approximate inclusion-exclusion
- Approximate inclusion-exclusion for arbitrary symmetric functions
- Approximating threshold circuits by rational functions
- Communication lower bounds using directional derivatives
- Computing Boolean functions by polynomials and threshold circuits
- Disjointness is hard in the multiparty number-on-the-forehead model
- Extremal combinatorics. With applications in computer science
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Formula lower bounds via the quantum method
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 5605137 (Why is no real title available?)
- scientific article; zbMATH DE number 5320343 (Why is no real title available?)
- scientific article; zbMATH DE number 3770219 (Why is no real title available?)
- scientific article; zbMATH DE number 1511696 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- Inclusion-exclusion: exact and approximate
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- Learning intersections and thresholds of halfspaces
- Limitations of Quantum Advice and One-Way Communication
- Making polynomials robust to noise
- Multiparty communication complexity and threshold circuit size of AC^0
- New degree bounds for polynomial threshold functions
- On the computational power of depth-2 circuits with threshold and modulo gates
- On the degree of Boolean functions as real polynomials
- Polynomial degree vs. quantum query complexity
- PP is closed under intersection
- Quantum algorithms and approximating polynomials for composed functions with shared inputs
- Quantum Algorithms for Element Distinctness
- Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
- Quantum communication complexity of symmetric predicates
- Quantum lower bound for the collision problem with small range
- Quantum lower bounds by polynomials
- Quantum lower bounds for the collision and the element distinctness problems
- Quantum Walk Algorithm for Element Distinctness
- Rational approximation techniques for analysis of neural networks
- Robust polynomials and quantum algorithms
- Separating AC\(^0\) from depth-2 majority circuits
- Separations in query complexity using cheat sheets
- The expressive power of voting polynomials
- The multiparty communication complexity of set disjointness
- The pattern matrix method
- The polynomial method strikes back: tight quantum query bounds via dual polynomials
- The quantum query complexity of \(\mathrm{AC}^0\)
- The Sign-Rank of AC^0
- Uniform approximation by (quantum) polynomials
Cited in
(24)- Polynomial algorithms in computer algebra
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
- Algorithmic problems for differential polynomial algebras
- Algorithms with polynomial interpretation termination proof
- Dual polynomials for collision and element distinctness
- The polynomial degree of recursive Fourier sampling
- Algorithms for Symbolic Polynomials
- A note on quantum algorithms and the minimal degree of -error polynomials for symmetric functions
- scientific article; zbMATH DE number 3987032 (Why is no real title available?)
- scientific article; zbMATH DE number 1929311 (Why is no real title available?)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0
- Approximate Degree in Classical and Quantum Computing
- A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials
- The polynomial method strikes back: tight quantum query bounds via dual polynomials
- Algorithmic polynomials
- On the sum-of-squares degree of symmetric quadratic functions
- Variation on Euclid's algorithm for polynomials
- Approximate degree, weight, and indistinguishability
- scientific article; zbMATH DE number 7651029 (Why is no real title available?)
- Algorithm for computing the truncation of the discriminant of a polynomial
- Polynomial approximation on disjoint segments and amplification of approximation
- The approximate degree of DNF and CNF formulas
- An Egyptian algorithm for polynomials
This page was built for publication: Algorithmic Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138783)
