Theory of Computing Systems

Consider the following decision problem: for a given monotone Boolean function f decide, whether f is read-once. For this problem, it is essential how the input function f is represented. Elbassioni et al. (J. Comb. Optim. 22(3), 293–304, 2011) ...

We investigate a variant of the so-called Internet Shopping problem introduced by Blazewicz et al. (Appl. Math. Comput. Sci. 20, 385–390, 2010), where a customer wants to buy a list of products at the lowest possible total cost from shops which ...

In this paper we study the directions of periodicity of multidimensional subshifts of finite type (SFTs) and of multidimensional effectively closed and sofic subshifts. A configuration of a subshift has a slope of periodicity if it is periodic in ...${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$${}^{\mathrm{}}$${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$

Every connected graph on n vertices has a cut of size at least n − 1. We call this bound the spanning tree bound. In the Max-Cut Above Spanning Tree (Max-Cut-AST) problem, we are given a connected n-vertex graph G and a non-negative integer k, and ...$\mathcal{}{\mathrm{}}^{}{}^{\mathcal{}\mathrm{}}$$\mathcal{}{}^{\mathrm{}}$

In this work we investigate the problem of quadratically tightly approximating the randomized query complexity of Boolean functions R(f). The certificate complexity C(f) is such a complexity measure for the zero-error randomized query complexity R_...${\mathsf{}}_{}^{}$

We study Parallel Task Scheduling Pm|size_j|C_max with a constant number of machines. This problem is known to be strongly NP-complete for each m ≥ 5, while it is solvable in pseudo-polynomial time for each m ≤ 3. We give a positive answer to the ...$\frac{\mathrm{}}{\mathrm{}}$$\frac{\mathrm{}}{\mathrm{}}$$\frac{\mathrm{}}{\mathrm{}}$

We introduce forest straight-line programs (FSLPs for short) as a compressed representation of unranked ordered node-labelled trees. FSLPs are based on the operations of forest algebra and generalize tree straight-line programs. We compare the ...

We investigate the problem of detecting periodic trends within a string S of length n, arriving in the streaming model, containing at most k wildcard characters, where k = o(n). A wildcard character is a special character that can be assigned any ...$\mathcal{}{}^{\mathrm{}}$$\frac{}{\mathrm{}}$$\mathcal{}{}^{\mathrm{}}{\mathrm{}}^{\mathrm{}}$