We study decoupling in quasi-Banach spaces. We show that decoupling is permissible in some quasi-Banach spaces (e.g., Lp and Lp/Hp when 0 < p < 1) but fails in other spaces such as the Schatten ideal Sp when 0 < p < 1. We also relate our ideas to a possible extension of the Grothendieck inequality.

We investigate the properties of a class of weighted vector-valued Lp-spaces and the corresponding (an)isotropic Sobolev-Slobodetskii spaces. These spaces arise naturally in the context of maximal Lp-regularity for parabolic initial-boundary value problems. Our main tools are operators with a bounded H∞-calculus, interpolation theory, and operator sums.

This paper presents an exhaustive analysis of the problem of computing the Lp distance of two probabilistic automata. It gives efficient exact and approximate algorithms for computing these distances for p even and proves the problem to be NP-hard for all odd values of p, thereby completing previously known hardness results. It further proves the hardness of approximating the Lp distance of two...

LP is a recent addition to probabilistic logic programming languages. Its main idea is to overcome the rigid nature of the stable model semantics by assigning a weight to each rule in a way similar to Markov Logic is defined. We present two implementations of LP, LPMLN2ASP and LPMLN2MLN. System LPMLN2ASP translates LP programs into the input language of answer set solver CLINGO, and using weak ...

Sharir and Welzl introduced an abstract framework for optimization problems, called LP-type problems or also generalized linear programming problems, which proved useful in algorithm design. We define a new, and as we believe, simpler and more natural framework: violator spaces, which constitute a proper generalization of LP-type problems. We show that Clarkson's randomized algorithms for low-d...