ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “multivariate polynomials”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

stat.MLcs.LGTheoreticalRecentOct 27, 2026

Low-degree polynomials lower bounds for clustering in small dimension

Alexandra Carpentier, Nicolas Verzelen

This paper studies the computational limits of clustering in a mixture of isotropic distributions in high dimensions.

View →
math.COcs.CCTheoreticalRecentJul 9, 2026

Polynomial Binary Optimization

Endre Boros

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…

View →
cs.CCmath.RATheoreticalRecentJun 6, 2026

Kronecker products and iterated matrix multiplication

Christian Ikenmeyer

This paper explores the properties of the Kronecker product of tensors and its applications to polynomial complexity theory.

View →
cs.SCcs.CCTheoreticalRecentJun 10, 2026

Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard

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.

View →
math.CAcs.ITTheoreticalRecentAug 6, 2026

On number of cyclic $n$-roots and disjointness of Fourier supports

Weiqi Zhou

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…

View →
cs.DScs.CCcs.GTTheoreticalRecentJul 28, 2026

A Unifying Framework for Quasi-Polynomial Optimization of Fixed-degree Polynomials

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Gabriele Farina

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…

View →
cs.CCTheoreticalRecentJun 14, 2026

The Exact Reach of Conormal Invariants in Determinantal Complexity: a Quadratic No-Go Theorem

Karthik Sheshadri

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…

View →
cs.CCTheoreticalRecentJun 11, 2026

A near-quadratic lower bound on the border determinantal complexity of $\sum_i x_i^n$ via conormal specialization

Karthik Sheshadri

This paper proves lower bounds on the border determinantal complexity of a specific polynomial.

View →
cs.CCcs.CRTheoreticalRecentOct 24, 2026

Bounds on polynomial approximations of the discrete logarithm function

Swastik Kopparty, Rishabh Kothary, Ashutosh Shankar

The authors improve bounds on how well polynomials can approximate the discrete log function.

View →
stat.MEeess.SPEmpiricalRecentJun 11, 2026

Volterra--Wiener--Kunchenko Orthogonalization: From Wiener--Hermite to Distribution-Matched Volterra Bases

Serhii Zabolotnii

The paper constructs a new basis for finite-memory Volterra identification from data, improving upon existing methods.

View →
cs.ITcs.GTTheoreticalRecentJun 12, 2026

The Algebraic Limits of Polynomial Information Measures

Yuqing Kong

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…

View →
cs.DSTheoreticalRecentSep 18, 2026

Faster SVP in Polynomial Space

Yansong Feng, Yiming Gao, Jiaqi Liu

The paper presents a randomized algorithm that solves the exact Euclidean shortest vector problem in polynomial space and improved time complexity.

View →
cs.CRMay 20, 2026

Graph Structure of Chebyshev Permutation Polynomials over Binary and Ternary Adic Rings

Xiaoxiong Lu, Yuling Dai, Chengqing Li

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…

View →
math.PRcs.DMcs.FLTheoreticalRecentJun 28, 2026

Note on Finite-Automata Bernoulli Factories for Rational Functions

Renato Paes Leme, Jon Schneider

This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.

View →
cs.DMTheoreticalRecentJun 11, 2026

Fibonacci and Catalan Numbers Meet in Staircase Polyominoes

Jean-Luc Baril, José Luis Ramírez, Samuel Ramírez, Diego Villamizar

This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.

View →
math.AGcs.NETheoreticalRecentJul 19, 2026

Expressivity of Shallow Neural Networks Over Finite Fields

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…

View →
cs.CCcs.GTcs.LGTheoreticalRecentJun 15, 2026

The Complexity of Min-Max Optimization for Quadratic Polynomials

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender

Computing approximate stationary points of min-max optimization over the hypercube is proven to be PPAD-hard for quadratic polynomials.

View →
math.COcs.ITTheoreticalRecentJun 12, 2026

Counting contiguous superregular $4 \times 4$ matrices

Carlo Sanna

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…

View →