Related papers: Width Hierarchy for k-OBDD of Small Width
We study the problem of processing continuous k nearest neighbor (CkNN) queries over moving objects on road networks, which is an essential operation in a variety of applications. We are particularly concerned with scenarios where the…
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…
This paper proves that in Size Theory the comparison of multidimensional size functions can be reduced to the 1-dimensional case by a suitable change of variables. Indeed, we show that a foliation in half-planes can be given, such that the…
We consider the problem of enumerating relevant features hidden in other irrelevant information for multi-labeled data, which is formalized as learning juntas. A $k$-junta function is a function which depends on only $k$ coordinates of the…
We establish precise spectral criteria for potential functions $V$ of reflectionless Schr\"odinger operators $L_V = -\partial_x^2 + V$ to admit solutions to the Korteweg de-Vries (KdV) hierarchy with $V$ as an initial value. More generally,…
We study the deterministic query complexity of Boolean functions on slices of the hypercube. The $k^{th}$ slice $\binom{[n]}{k}$ of the hypercube $\{0,1\}^n$ is the set of all $n$-bit strings with Hamming weight $k$. We show that there…
Functional geometry is a framework using concepts from geometry to understand the invariance of amplitudes in quantum field theory under a large class of field redefinitions, including those involving derivatives. It is inspired by…
We introduce and investigate symbolic proof systems for Quantified Boolean Formulas (QBF) operating on Ordered Binary Decision Diagrams (OBDDs). These systems capture QBF solvers that perform symbolic quantifier elimination, and as such…
A type system is introduced for a generic Object Oriented programming language in order to infer resource upper bounds. A sound andcomplete characterization of the set of polynomial time computable functions is obtained. As a consequence,…
Overlap functions are a class of aggregation functions that measure the overlapping degree between two values. Interval-valued overlap functions were defined as an extension to express the overlapping of interval-valued data, and they have…
Assume that M is a compact n-dimensional manifold and that N is obtained by surgery along a k-dimensional sphere, k\le n-3. The smooth Yamabe invariants \sigma(M) and \sigma(N) satisfy \sigma(N)\ge min (\sigma(M),\Lambda) for \Lambda>0. We…
The OSSS inequality [O'Donnell, Saks, Schramm and Servedio, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), Pittsburgh (2005)] gives an upper bound for the variance of a function f of independent 0-1 valued random…
We classify both local and global K\"ahler structures admitting totally geodesic homothetic foliations with complex leaves. The main building blocks are related to Swann's twists and are obtained by applying Weinstein's method of…
We give a self contained proof using Seiberg Witten invariants that for K\"ahler surfaces with non negative Kodaira dimension (including those with $p_g = 0$) the canonical class of the minimal model and the $(-1)$-curves, are oriented…
This paper identifies a structural property of data distributions that enables deep neural networks to learn hierarchically. We define the "staircase" property for functions over the Boolean hypercube, which posits that high-order Fourier…
We continue to investigate applications of $k$-covers in function spaces with the compact-open topology.
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth. On…
We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end, define the "underlying treewidth" of a graph class…
We study several bialgebraic structures on boolean functions, that is to say maps defined on the set of subsets of a finite set $X$, taking the value $0$ on $\emptyset$. Examples of boolean functions are given by the indicator function of…
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate degree composes for…