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

20 results for “Lambert function”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.DMcs.LGmath.COTheoreticalRecentJun 28, 2026

Chamber geometry and specification numbers of Boolean threshold functions

Martin Anthony

This paper develops a geometric interpretation for the specification number of Boolean threshold functions and evaluates the average specification number, settling a question in the field.

View →
cs.GRcs.AIEmpiricalRecentJun 30, 2026

Intrinsic decomposition and editing of 3D Gaussian splats

Alexandre Lanvin, Jeffrey Hu, Simon Lucas, Adrien Bousseau +1 more

This paper proposes methods for intrinsic decomposition of radiance fields using Gaussian splatting, enabling adaptive modeling, disentanglement, and editing of textures in images.

View →
cs.CRcs.ITmath.COEmpiricalRecentJun 10, 2026

Quadratic APN Functions in Dimension 8 via Gröbner Basis Search in a Self-Equivalence Subspace

Oleksandr Kuznetsov

The paper describes a computational search for quadratic APN functions in dimension 8 within a structured self-equivalence subspace.

View →
cs.NETheoreticalRecentJun 11, 2026

Improved Runtime Bound for the $(μ+ 1)$ EA on BinVal

Joris Belder, Johannes Lengler, Raghu Raman Ravi

This paper improves the upper bound for the (μ+1) EA on the Binary Value function BinVal.

View →
cs.DSmath-phmath.CATheoreticalRecentJun 22, 2026

Computing Gaussian and exponential integrals in ${\Bbb R}^n$

Alexander Barvinok

This paper proves conditions for efficiently approximating expectations of certain functions with respect to standard Gaussian or symmetric exponential probability measures.

View →
cs.CGcs.DSmath.MGTheoreticalRecentJun 15, 2026

A constant-factor approximation of the Gromov-Hausdorff distance in the plane

Sushovan Majhi

The paper provides a polynomial-time constant-factor approximation of the Gromov-Hausdorff distance between finite point sets in the Euclidean plane.

View →
cs.CRmath.FAMay 3, 2026

Limit Properties at Critical Indices of Linear Canonical Riesz Potentials and Their Applications to Security of Multi-Image Encryption

Zunwei Fu, Dachun Yang, Shuhui Yang

The paper introduces the linear canonical Riesz potential (LCRP) and analyzes its convergence properties, leveraging these findings to propose a novel, secure, and efficient asymmetric cascaded LCRP m…

View →
eess.SPTheoreticalRecentSep 18, 2026

The Impact of the Cauchy Interlace Theorem on the Convergence of the RLS Algorithm

Hans Georg Brachtendorf

This paper analyzes the convergence of the RLS algorithm using the Cauchy Interlace Theorem and presents an improved initialization method.

View →
math.PRcs.ITmath.MGTheoreticalRecentJul 15, 2026

Stochastic Domination of Gaussian Maxima: A Resolution to the Weak Simplex Conjecture

Abhijeet Mulgund

The paper proves a stochastic comparison for Gaussian maxima, resolving the Weak Simplex Conjecture and proving the Simplex Mean Width Conjecture.

View →
math.AGcs.AIcs.NERecentMay 27, 2026

Real-rootedness of the Poincaré polynomials of $\overline{\mathcal M}_{0,n}$: an AI-assisted proof

Gergely Bérczi, Young-Hoon Kiem

The paper proves the real-rootedness and ultra-log-concavity of the Poincaré polynomials for the moduli space $\overline{\mathcal M}_{0,n}$ and the Fulton--MacPherson space $\mathbb{P}^1[n]$ using a n…

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 →
cs.LGcs.CCTheoreticalRecentJun 17, 2026

Some Complexity Results for Robustness Verification for Binarized Neural Networks

Harshit Goyal, Sudakshina Dutta

This paper studies the computational complexity of verification problems for Binarized Neural Networks (BNNs).

View →
math.OCcs.DSTheoreticalRecentOct 19, 2026

Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time

Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver +1 more

This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.

View →
cs.DScs.CRmath.NTMay 17, 2026

Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice

Ming-Xing Luo

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

View →