MFCS
2005
Springer
14 years 5 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
MFCS
2005
Springer
14 years 5 months ago
2005
Springer
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
MFCS
2005
Springer
14 years 5 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
MFCS
2005
Springer
14 years 5 months ago
2005
Springer
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
MFCS
2005
Springer
14 years 5 months ago
2005
Springer
MFCS
2005
Springer
14 years 5 months ago
2005
Springer
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...
MFCS
2005
Springer
14 years 5 months ago
2005
Springer
MFCS
2005
Springer
14 years 5 months ago
2005
Springer
A partial information algorithm for a language A computes, for some fixed m, for input words x1, . . . , xm a set of bitstrings containing χA(x1, . . . , xm). E.g., p-selective, ...
MFCS
2005
Springer
14 years 5 months ago
2005
Springer
A sequential algorithm just follows its instructions and thus cannot make a nondeterministic choice all by itself, but it can be instructed to solicit outside help to make a choic...
MFCS
2005
Springer
14 years 5 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...