Mostra el registre d'ítem simple
Self-reducible sets of small density
| dc.contributor.author | Lozano Boixadors, Antoni |
| dc.contributor.author | Torán Romero, Jacobo |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
| dc.date.accessioned | 2020-06-17T16:17:45Z |
| dc.date.available | 2020-06-17T16:17:45Z |
| dc.date.issued | 1989-11 |
| dc.identifier.citation | Lozano, A.; Toran, J. "Self-reducible sets of small density". 1989. |
| dc.identifier.uri | http://hdl.handle.net/2117/190992 |
| dc.description.abstract | We study the complexity of sets that are at the same time self-reducible and sparse or m-reducible to sparse sets. We show that sets of this kind are low for the complexity clases [delta sub 2 super p], [fi sub 2 super p], NP or P, depending on the type of self-reducibility used and on certain restrictions imposed on the query mechanism of the self-reducibility machines. The proof of some of these results is based on graph theoretic properties that hold for the graphs induced by the self-reducibility structures. |
| dc.format.extent | 17 p. |
| dc.language.iso | eng |
| dc.relation.ispartofseries | LSI-89-27 |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
| dc.subject | Àrees temàtiques de la UPC::Informàtica |
| dc.subject.lcsh | Human-computer interaction |
| dc.title | Self-reducible sets of small density |
| dc.type | External research report |
| dc.subject.lemac | Interacció persona-ordinador |
| dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
| dc.rights.access | Open Access |
| local.identifier.drac | 1837522 |
| dc.description.version | Postprint (published version) |
| local.citation.author | Lozano, A.; Toran, J. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [40]
-
Reports de recerca [1.107]