Related papers: Nonlinearity measures of random Boolean functions
We consider functions on the $d$-dimensional unit cube whose partial derivatives up to order $r$ are bounded by one. It is known that the minimal number of function values that is needed to approximate the integral of such functions up to…
A second-order regularity theory is developed for solutions to a class of quasilinear elliptic equations in divergence form, including the $p$-Laplace equation, with merely square-integrable right-hand side. Our results amount to the…
A loss function measures the discrepancy between the true values (observations) and their estimated fits, for a given instance of data. A loss function is said to be proper (unbiased, Fisher consistent) if the fits are defined over a unit…
Three measures of pseudorandomness of finite binary sequences were introduced by Mauduit and S\'ark\"ozy in 1997 and have been studied extensively since then: the normality measure, the well-distribution measure, and the correlation measure…
We propose a quantum algorithm to estimate the Gowers $U_2$ norm of a Boolean function, and extend it into a second algorithm to distinguish between linear Boolean functions and Boolean functions that are $\epsilon$-far from the set of…
New vapor-liquid equilibrium (VLE) data are continuously being measured and new parameter values, e.g., for the nonrandom two-liquid (NRTL) model are estimated and published. The parameter $\alpha$, the nonrandomness parameter of NRTL, is…
We investigate the order of the variance of the optimal alignments score of two independent iid binary random words having the same length. The letters are equiprobable, but the scoring function is such that one letter has a larger score…
This paper considers fault estimation in nonlinear fractional order systems in observer form. For this aim, a step by step second order sliding mode observer is used. By means of a fractional inequality, the stability of the observer…
The Horton-Strahler analysis is a graph-theoretic method to measure the bifurcation complexity of branching patterns, by defining a number called the order to each branch. The main result of this paper is a large deviation theorem for the…
Dominant areas of computer science and computation systems are intensively linked to the hypercube-related studies and interpretations. This article presents some transformations and analytics for some example algorithms and Boolean domain…
The theory of nonlinear balanced truncation provides a system-theoretic framework for model reduction that preserves important properties such as stability, controllability, and observability. We present a scalable algorithm for computing…
In numerical simulations of many charged systems at the micro/nano scale, a common theme is the repeated solution of the Poisson-Boltzmann equation. This task proves challenging, if not entirely infeasible, largely due to the nonlinearity…
In this paper, we establish a new inequality tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We…
In this note we compare two measures of the complexity of a class $\mathcal F$ of Boolean functions studied in (unconditional) pseudorandomness: $\mathcal F$'s ability to distinguish between biased and uniform coins (the coin problem), and…
Various problems in engineering and natural science demand binary sequences that do not resemble translates of themselves, that is, the sequences must have small aperiodic autocorrelation at every nonzero shift. If $f$ is a sequence, then…
In this paper, we study the value distributions of perfect nonlinear functions, i.e., we investigate the sizes of image and preimage sets. Using purely combinatorial tools, we develop a framework that deals with perfect nonlinear functions…
The minimum number of NOT gates in a logic circuit computing a Boolean function is called the inversion complexity of the function. In 1957, A. A. Markov determined the inversion complexity of every Boolean function and proved that…
The theorem states that: Every Boolean function can be $\epsilon -approximated$ by a Disjunctive Normal Form (DNF) of size $O_{\epsilon}(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is…
We study the probability of making an error if, by querying an oracle a fixed number of times, we declare constant a randomly chosen n-bit Boolean function. We compare the classical and the quantum case, and we determine for how many…
We consider a finite mixture model with varying mixing probabilities. Linear regression models are assumed for observed variables with coefficients depending on the mixture component the observed subject belongs to. A modification of the…