Reports de recerca
Recent Submissions
-
Bateria de afasias Western. Cuaderno de estímulos en castellano.
(2022-09)
Research report
Restricted access - publisher's policyQuadern d'estímuls de la bateria d'afàsies Western adaptat per a la llengua castellana. Pensat per a passar a pacients amb afàsia. Es pot aplicar per a controls monolingües en l'estudi en contextos bilingües. -
A note on the query complexity of learning DFA
(1992)
Research report
Open AccessIt is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries ... -
Categorical formalisation of relativisation : pied piping, islands, and extraction sites
(1992-09-27)
Research report
Open Access -
A first-order isomorphism theorem
(1992)
Research report
Open AccessWe show that for most complexity classes of interest, all sets complete under first-order projections are isomorphic under first-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds. -
Some structural complexity aspects of neural computation
(1992)
Research report
Open AccessRecent work by Siegelmann and Sontag has demonstrated that polynomial time on linear saturated recurrent neural networks equas polynomial time on standard computational models: Turing machines if the weights of the net are ... -
The [Theta]-operator and the low hierarchy
(1992-07)
Research report
Open AccessLong and Sheu in their paper [LS-91] introduced a refinement of the low hierarchy based on the [Theta]-levels of the polynomial time hierarchy which gives a deeper sight of the internal structure of NP. In this paper we ... -
Apuntes sobre el cálculo de la eficiencia de los algoritmos
(1993-09)
Research report
Open Access -
Anàlisi d'un algorisme de multiplicació d'enters
(1993-10)
Research report
Open AccessEs proposa un algorisme de multiplicació d'enters basat en l'esquema "divideix i venç", però diferent del de Karatsuba i Ofman. Es fa l'anàlisi de la seva complexitat. Es troba que, encara que sembli millor que els ja ... -
Una altra demostració del teorema de Cook
(1993-06-04)
Research report
Open AccessPresentem una demostració alternativa del Teorema de Cook: saber si una fòrmula booleana és satisfactible és un problema NP-complet. La demostració es diferencia de les altres que conec en dos aspectes. Un, que defineixo ... -
The complexity of learning with queries
(1994-04-14)
Research report
Open AccessWe survey recent research concerning the qualitative complexity of Angluin's model of learning with queries. In this model, there is a learner that tries to identify a target concept by means of queries to a teacher. Thus, ... -
Type-logical grammar
(1992)
Research report
Open Access -
Algoritmos de distancias mínimas en grafos
(1986-05)
Research report
Open Access
RSS 1.0