Related papers: Bounded time computation on metric spaces and Bana…
This article gives dual representations for convex integral functionals on the linear space of regular processes. This space turns out to be a Banach space containing many more familiar classes of stochastic processes and its dual can be…
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…
Measurement-based quantum computation (MBQC) is a protocol for quantum computation that represents a model distinct from the circuit-based approach. MBQC has been proposed not only for qubits but also for qudits, continuous-variable (CV)…
The Cauchy slicings for globally hyperbolic spacetimes and their relation with the causal boundary are surveyed and revisited, starting at the seminal conformal boundary constructions by R. Penrose. Our study covers: (1) adaptive…
We study the time complexity of the weighted first-order model counting (WFOMC) over the logical language with two variables and counting quantifiers. The problem is known to be solvable in time polynomial in the domain size. However, the…
The increasing importance of such fields as embedded systems, pervasive computing, and hybrid systems control is increasing attention to the time-dependent aspects of system modeling. In this paper, we focus on modeling conceptual time.…
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisimulation for continuous-time probabilistic processes to a…
From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation…
Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed…
Binary embedding of high-dimensional data requires long codes to preserve the discriminative power of the input space. Traditional binary coding methods often suffer from very high computation and storage costs in such a scenario. To…
We work with very general Banach spaces of analytic functions in the disk or other domains which satisfy a minimum number of natural axioms. Among the preliminary results, we discuss some implications of the basic axioms and identify all…
It is well known that the description of topological and geometric properties of bisectors in normed spaces is a non-trivial subject. In this paper we introduce the concept of bounded representation of bisectors in finite dimensional real…
The problem of classifying boundary points of space-time, for example singularities, regular points and points at infinity, is an unexpectedly subtle one. Due to the fact that whether or not two boundary points are identified or even…
In a previous paper, the authors showed that in a reflexive Banach space the lower limit of a sequence of maximal monotone operators is always representable by a convex function. The present paper gives precisions to the latter result by…
In this article, we consider abstract linear conservative systems and their time-discrete counterparts. Our main result is a representation formula expressing solutions of the continuous model through the solution of the corresponding…
Recently, many works have focused on the characterization of non-linear dimensionality reduction methods obtained by quantizing linear embeddings, e.g., to reach fast processing time, efficient data compression procedures, novel…
We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
The main result says that every surjective isometry between two ideal Banach function spaces satisfying certain conditions can be presented as a composition of a measurable transformation of a variable and multiplication by a function.
In this paper, we develop a comprehensive weighted theory for a class of Banach-valued multilinear bounded oscillation operators on measure spaces, which merges multilinear Calder\'{o}n-Zygmund operators with a quantity of operators beyond…