相关论文: Analysis of Boolean Functions

The M{\"o}bius transform is a crucial transformation into the Boolean world; it allows to change the Boolean representation between the True Table and Algebraic Normal Form. In this work, we introduce a new algebraic point of view of this…

The present article is an extended version of [6] containing new results and an updated list of references. We review the notion of polar analyticity introduced in a previous paper and succesfully applied in Mellin analysis and quadrature…

Some Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given…

This paper revisits the problem of learning a k-CNF Boolean function from examples in the context of online learning under the logarithmic loss. In doing so, we give a Bayesian interpretation to one of Valiant's celebrated PAC learning…

This is a tutorial on duality properties of special functions, mainly of orthogonal polynomials in the ($q$-)Askey scheme. It is based on the first part of the 2017 R.P. Agarwal Memorial Lecture delivered by the author.

A modestly revised version of lecture notes that were distributed to accompany my four lectures at the 2017 Spring School of Analysis at Paseky, sponsored by Charles University, Prague. They are an introductory survey of Rubio de Francia…

We study the number of real rational degree n functions (considered up to linear fractional transformations of the independent variable) with a given set of 2n-2 distinct real critical values. We present a combinatorial reformulation of…

This write-up is the suggested lecture notes for a second level course on advanced topics in database systems for master's students of Computer Science with a theoretical focus. A prerequisite in algorithms and an exposure to database…

Boolean functions can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic programs. In this paper, a variety of issues pertaining to the efficient Prolog implementation of…

Formulated problems concern the following topics: (1) Birationally nonequivalent linear actions; (2) Cayley degrees of simple algebraic groups; (3) Singularities of two-dimensional quotients.

This is an expository article based on my lectures on eigenfunctions of the Laplacian for the 2013 IAS/Park City Mathematics Institute (PCMI) summer school in geometric analysis. Many of the results are based on joint work with H.…

Workshop presentations on elastic and diffractive scattering and other recent advances in hadron physics are summarized. The role of ``factorization'' in determining parton properties of the pomeron is particularly discussed.

We describe a new class of Boolean functions which provide the presently best known trade-off between low computational complexity, nonlinearity and (fast) algebraic immunity. In particular, for $n\leq 20$, we show that there are functions…

Here we present our arguments for a more in-depth study of the Boolean cube, which is one of the most important discrete structures. The article contains a case study that analyses how the Boolean cube has been included and explained in…

Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…

This paper is a write-up for the tutorial on "Fine-grained Interpretation and Causation Analysis in Deep NLP Models" that we are presenting at NAACL 2021. We present and discuss the research work on interpreting fine-grained components of a…

Fourier analysis on the discrete hypercubes $\{-1,1\}^n$ has found numerous applications in learning theory. A recent breakthrough involves the use of a classical result from Fourier analysis, the Bohnenblust--Hille inequality, in the…

Extensive studies of Boolean functions are carried in many fields. The Mobius transform is often involved for these studies. In particular, it plays a central role in coincident functions, the class of Boolean functions invariant by this…

We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set of rational-valued functions, which generalize constraints.…

Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of $O(n^3 \log^2 n . E +n^4 {\log}^{O(1)}…