Reports de recerca
Recent Submissions
-
Speech pause distribution as an early marker for Alzheimer’s disease
(2021-01)
Research report
Open AccessBackground: 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 ... -
Adaptive logspace reducibility and parallel time
(1991-11)
Research report
Open AccessWe discuss two notions of functional oracle for logarithmic space-bounded machines, which differ in whether there is only one oracle tape for both the query and the answer or a separate tape for the answer, which can still ... -
An approach to correctness of data parallel algorithms
(1991-05)
Research report
Open AccessThe 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 ... -
A positive relativization of polynomial time vs. polylog space
(1991-05)
Research report
Open AccessCan every set in P be solved in polylogarithmic space? We show that this question is equivalent to asking whether the classes PSPACE and EXPTIME are always equal under relativization. We use an oracle access mechanism that ... -
Adaptive logspace and depth-bounded reducibilities
(1991-04)
Research report
Open AccessWe 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 ... -
Characterizations of some complexity classes between [theta sub 2 super p] and [delta sub 2 super p]
(1990)
Research report
Open AccessWe give some characterizations of the classes P super NP [0(log super k n)]. First, we show that these classes are equal to classes AC super k-1 (N P). Second, we prove that they are also equivalent to some classes defined ... -
Generalized Kolmogorov complexity in relativized separations
(1990-04)
Research report
Open AccessWe 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 ... -
Functional oracle queries as a measure of parallel time
(1990-08)
Research report
Open AccessWe discuss two notions of functional oracle for logarithmic space-bounded machines, which differ in whether there is only one oracle tape for both the query and the answer or a separate tape for the answer, which can still ... -
Deciding bisimilarity is P-complete
(1990)
Research report
Open AccessOn 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 ... -
Parallel complexity in the design and analysis of concurrent systems
(1990-10)
Research report
Open AccessWe study the parallel complexity of three problems on concurrency: decision of firing sequences for Petri nets, trace equivalence for partially commutative monoids, and strong bisimilarity in finite transition systems. We ... -
Computational complexity of small descriptions
(1990-11-19)
Research report
Open AccessFor 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 ... -
Embedding: a unifying concept for recursive program design
(1988)
Research report
Open AccessThe concept of embedding one function into another is used to get a unified view of some well-known design techniques, such as loop derivation using inveriants, recursion removal, or folding-unfolding. A design method for ...
RSS 1.0