Related papers: Parametrized complexity of relations between multi…
We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…
We study extensions of the Election Isomorphism problem, focused on the existence of isomorphic subelections. Specifically, we propose the Subelection Isomorphism and the Maximum Common Subelection problems and study their computational…
Partitionings (or segmentations) divide a given domain into disjoint connected regions whose union forms again the entire domain. Multi-dimensional partitionings occur, for example, when analyzing parameter spaces of simulation models,…
A classic result of Lenstra [Math.~Oper.~Res.~1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameter being the number of variables. We extend this result by incorporating…
We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraints, maximum number of occurrences of a variable in the…
We investigate simple examples of supersymmetry algebras with real and Grassmann parameters. Special attention is payed to the finite supertransformations and their probability interpretation. Furthermore we look for combinations of bosons…
Binary size reduction is an increasingly important optimization objective for compilers. One emerging technique is function merging, where multiple similar functions are merged into one, thereby eliminating redundancy. The SOTA approach to…
We study the randomized $n$-th minimal errors (and hence the complexity) of vector valued mean computation, which is the discrete version of parametric integration. The results of the present paper form the basis for the complexity analysis…
We consider parameterized concurrent systems consisting of a finite but unknown number of components, obtained by replicating a given set of finite state automata. Components communicate by executing atomic interactions whose participants…
A \emph{2-interval} is the union of two disjoint intervals on the real line. Two 2-intervals $D_1$ and $D_2$ are \emph{disjoint} if their intersection is empty (i.e., no interval of $D_1$ intersects any interval of $D_2$). There can be…
We will cover the basics of several complex variables in 4 lectures: Basic properties of holomorphic functions in several variables, the notion of pseudoconvexity, CR functions and CR geometry, and the $\bar\partial$-problem. The main…
For dynamical systems that switch between different modes of operation, parameter variation can cause periodic solutions to lose or acquire new switching events. When this causes the eigenvalues (stability multipliers) associated with the…
Movement primitives are an important policy class for real-world robotics. However, the high dimensionality of their parametrization makes the policy optimization expensive both in terms of samples and computation. Enabling an efficient…
We introduce a novel generative formulation of deep probabilistic models implementing "soft" constraints on their function dynamics. In particular, we develop a flexible methodological framework where the modeled functions and derivatives…
The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…
Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint…
In this letter, we perform a sensitivity analysis on the master stability function approach for the synchronization of networks of coupled dynamical systems. More specifically, we analyze the linear stability of a nearly synchronized…
Many machine learning problems, especially multi-modal learning problems, have two sets of distinct features (e.g., image and text features in news story classification, or neuroimaging data and neurocognitive data in cognitive science…
We study a collection of stability conditions (in the sense of Schmitt) for complexes of sheaves over a smooth complex projective variety indexed by a positive rational parameter. We show that the Harder-Narasimhan filtration of a complex…
This paper provides a systematic study of fundamental combinatorial properties of one-dimensional, two-sided infinite simple Toeplitz subshifts. Explicit formulas for the complexity function, the palindrome complexity function and the…