20 results for “Lambert function”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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.
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.
The paper describes a computational search for quadratic APN functions in dimension 8 within a structured self-equivalence subspace.
This paper improves the upper bound for the (μ+1) EA on the Binary Value function BinVal.
This paper proves conditions for efficiently approximating expectations of certain functions with respect to standard Gaussian or symmetric exponential probability measures.
The paper provides a polynomial-time constant-factor approximation of the Gromov-Hausdorff distance between finite point sets in the Euclidean plane.
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…
This paper analyzes the convergence of the RLS algorithm using the Cauchy Interlace Theorem and presents an improved initialization method.
The paper proves a stochastic comparison for Gaussian maxima, resolving the Weak Simplex Conjecture and proving the Simplex Mean Width Conjecture.
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…
This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.
This paper studies the computational complexity of verification problems for Binarized Neural Networks (BNNs).
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.
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…