Mostra el registre d'ítem simple
Characterizing the learnability of Kolmogorov easy circuit expressions
dc.contributor.author | Balcázar Navarro, José Luis |
dc.contributor.author | Buhrman Canal, Harry |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-02-03T12:08:05Z |
dc.date.available | 2016-02-03T12:08:05Z |
dc.date.issued | 1996-01 |
dc.identifier.citation | Balcazar, J. L., Buhrman, H. "Characterizing the learnability of Kolmogorov easy circuit expressions". 1996. |
dc.identifier.uri | http://hdl.handle.net/2117/82488 |
dc.description.abstract | We show that Kolmogorov easy circuit expressions can be learned with membership queries in polynomial time if and only if every NE-predicate is E-solvable. Moreover we show that the previously known algorithm, that uses an oracle in NP, is optimal in some relativized world. |
dc.format.extent | 5 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.other | Kolmogorov complexity |
dc.subject.other | Circuit expressions |
dc.title | Characterizing the learnability of Kolmogorov easy circuit expressions |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1835641 |
dc.description.version | Postprint (published version) |
local.citation.author | Balcazar, J. L.; Buhrman, H. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]