Related papers: Unit contradiction versus unit propagation
We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…
The floor and ceiling functions appear often in mathematics and manipulating sums involving floors and ceilings is a subtle game. Fortunately, the well-known textbook Concrete Mathematics provides a nice introduction with a number of…
Functional equations satisfied by additive functions have a special interest not only in the theory of functional equations, but also in the theory of (commutative) algebra because the fundamental notions such as derivations and…
Structured $d$-DNNFs and SDDs are restricted negation normal form circuits used in knowledge compilation as target languages into which propositional theories are compiled. Structuredness is imposed by so-called vtrees. By definition SDDs…
A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…
This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…
In this paper we consider an application of the recently proposed quantum hashing technique for computing Boolean functions in the quantum communication model. The combination of binary functions on non-binary quantum hash function is done…
We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive normal form with the property that unit propagation on the…
The so-called polynomial equations play an important role both in algebra and in the theory of functional equations. If the unknown functions in the equation are additive, relatively many results are known. However, even in this case, there…
We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such…
The influence of the $k$'th coordinate on a Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ is the probability that flipping $x_k$ changes the value $f(x)$. The total influence $I(f)$ is the sum of influences of the coordinates. The…
We present a framework for studying circuit complexity that is inspired by techniques that are used for analyzing the complexity of CSPs. We prove that the circuit complexity of a Boolean function $f$ is characterized by the partial…
In this paper, we construct some piecewise defined functions, and study their $c$-differential uniformity. As a by-product, we improve upon several prior results. Further, we look at concatenations of functions with low differential…
Boundary conformal field theory (BCFT) is the study of conformal field theory (CFT) on manifolds with a boundary. We can use conformal symmetry to constrain correlation functions of conformal invariant fields. We compute two-point and…
The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…
Lately, there have been intensive studies on strengths and limitations of nonuniform families of promise decision problems solvable by various types of polynomial-size finite automata families, where ``polynomial-size'' refers to the…
We investigate compressibility of the dimension of positive semidefinite matrices while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of…
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…
Counterfactual (CF) explanations, also known as contrastive explanations and algorithmic recourses, are popular for explaining machine learning models in high-stakes domains. For a subject that receives a negative model prediction (e.g.,…
We investigate a separability criterion based on the computable cross-norm (CCNR), and a related quantity called the CCNR negativity. We introduce a reflected version of the CCNR negativity, and discuss its connection with other…