Asymptotics of the number of 2-threshold functions
Abstract: A $k$-threshold function on a rectangular grid of size $m \times n$ is the conjunction of $k$ threshold functions on the same domain. In this paper, we focus on the case $k=2$ and show that the number of two-dimensional 2-threshold functions is~$\dfrac{25}{12\pi4} m4 n4 + o(m4n4)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.