Background: Pause duration analysis is a common feature in the study of discourse in Alzheimer’s disease (AD) and may also be helpful for its early detection. However, studies involving patients at the preclinical stage ...

The design of data parallel algorithms for fine-grained SIMD machines is a fundamental domain in today computer science. High standards in the specification and resolution of problems have been achieved in the sequential ...

We discuss a number of results regarding an important subject: the study of the computational power of depth-bounded reducibilities, their use to classify the complexity of computational problems, and their characterizations ...

We describe several developments of a technique, due to Hartmanis, that uses Kolmogorov complexity to prove the existence of relativizations separating complexity classes. The main advantage of these proofs is that they ...

On finite labelled transition systems, the problems of deciding strong bisimilarity, observation equivalence, and observation congruence are P-complete under many-one NC-reducibility. As a consequence, algorithms for ...

For a set L that is polynomial time reducible (in short, = sub T super P-reducible) to some sparse set, we investigate the computational complexity of such sparse sets relative to L. We construct sets A and B such that ...