20 results for “multivariate polynomials”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper studies the computational limits of clustering in a mixture of isotropic distributions in high dimensions.
The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…
This paper explores the properties of the Kronecker product of tensors and its applications to polynomial complexity theory.
Ruichen Qiu, Yichuan Cao, Qiao-Long Huang, Ruyong Feng +1 more
This paper proves that output-sensitive sparse polynomial GCD computation over finite fields is NP-hard.
The paper shows that for composite square free n, there exist two vectors with disjoint supports in both time and frequency domains, contradicting a reduction in Haagerup's proof for prime n that fini…
This paper constructs an epsilon-cover of the joint value set of m constant-degree polynomials over a convex set H in the linfty-norm, with size n^(O(log(mn)/ε^2)), given that the polynomials have a c…
The paper studies the polar method for determinantal-complexity lower bounds and provides quantitative results on the intersection-theoretic complexity of kernel-incidence constructions and the size o…
This paper proves lower bounds on the border determinantal complexity of a specific polynomial.
The authors improve bounds on how well polynomials can approximate the discrete log function.
The paper constructs a new basis for finite-memory Volterra identification from data, improving upon existing methods.
This paper studies the existence of polynomial measures of dependence between two random variables that satisfy the data processing inequality and vanish on independence. It proves that no such polyno…
The paper presents a randomized algorithm that solves the exact Euclidean shortest vector problem in polynomial space and improved time complexity.
This paper characterizes the graph structure, including cycle and path lengths, of Chebyshev permutation polynomials over the ring $\mathbb{Z}_{2^{k_1}3^{k_2}}$, demonstrating strong regularities desp…
This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.
This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.
Maksym Zubkov, Carol Wu, Shiwei Yang, Param Mody +1 more
This paper studies the expressivity of shallow polynomial neural networks with monomial activation functions over finite fields, quantifying it by the cardinality of the neuromanifold and deriving low…
Computing approximate stationary points of min-max optimization over the hypercube is proven to be PPAD-hard for quadratic polynomials.
The paper explains a method for finding the number of solutions to a system of multivariate polynomial inequalities over a finite field and applies it to find formulas for the number of contiguous sup…