Related papers: The Complexity of Boolean Conjunctive Queries with…
We develop a model in which interactions between nodes of a dynamic network are counted by non homogeneous Poisson processes. In a block modelling perspective, nodes belong to hidden clusters (whose number is unknown) and the intensity…
In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…
The "simplicial complexes" and "join" (*) today used within combinatorics aren't the classical concepts, cf. Spanier (1966) p. 108-9, but, exept for \emptyset, complexes having {\emptyset} as a subcomplex resp. \Sigma1 * \Sigma2 := {\sigma1…
The query containment problem is a fundamental algorithmic problem in data management. While this problem is well understood under set semantics, it is by far less understood under bag semantics. In particular, it is a long-standing open…
Information inequalities appear in many database applications such as query output size bounds, query containment, and implication between data dependencies. Recently Khamis et al. proposed to study the algorithmic aspects of information…
Inconsistencies are pointed out in a recent proposal [L. Diosi, Phys. Rev. A 80, 064104 (2009); arXiv:0905.3908v1] for a quantum version of the classical linear Boltzmann equation.
Lines and circles pose significant scalability challenges in synthetic geometry. A line with $n$ points implies ${n \choose 3}$ collinearity atoms, or alternatively, when lines are represented as functions, equality among ${n \choose 2}$…
We study the computational complexity of two Boolean nonlinearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the multiplicative complexity in time…
The adjunction inequality is a key tool for bounding the genus of smoothly embedded surfaces in 4-manifolds. Using gauge-theoretic invariants, many versions of this inequality have been established for both closed surfaces and surfaces with…
A common theme underlying many problems in statistics and economics involves the determination of a systematic method of selecting a joint distribution consistent with a specified list of categorical marginals, some of which have an ordinal…
This paper is concerned with the inelastic Boltzmann equation without angular cutoff. We work in the spatially homogeneous case. We establish the global-in-time existence of measure-valued solutions under the generic hard potential…
For flows the rank is an invariant by linear change of time. But what we can say about isomorphisms? It seems that in case of mixing flows this problem is the most difficult. However the known technique of joinings provides non-isomorphism…
In this paper, we study the query complexity of Boolean functions in the presence of uncertainty, motivated by parallel computation with an unlimited number of processors where inputs are allowed to be unknown. We allow each query to…
There are many physical processes that have inherent discontinuities in their mathematical formulations. This paper is motivated by the specific case of collisions between two rigid or deformable bodies and the intrinsic nature of that…
This paper is concerned with the study of a model case of first order Hamilton-Jacobi equations posed on a "junction", that is to say the union of a finite number of half-lines with a unique common point. The main result is a comparison…
By elaborating on the recent progress made in the area of Feynman integrals, we apply the intersection theory for twisted de Rham cohomologies to simple integrals involving orthogonal polynomials, matrix elements of operators in Quantum…
We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies. We use known lower…
We present an index structure to boost the evaluation of free-connex acyclic conjunctive queries (fc-ACQs) over relational databases. The main ingredient of the index associated with a given database $D$ is an auxiliary database $D_{col}$.…
One of the major challenges in enterprise data analysis is the task of finding joinable tables that are conceptually related and provide meaningful insights. Traditionally, joinable tables have been discovered through a search for similar…
We establish a lower bound of $\Omega{(\sqrt{n})}$ on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that $\Omega(\sqrt{D(f)})$ is a lower bound for all Boolean functions.…