Mostra el registre d'ítem simple

dc.contributor.authorCases Muñoz, Rafael
dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorSteyaert, Jean-Marc
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2020-05-22T17:14:25Z
dc.date.available2020-05-22T17:14:25Z
dc.date.issued1988
dc.identifier.citationCases, R.; Diaz, J.; Steyaert, J. "Average case analysis of Robinson's unification algorithm with two different variables". 1988.
dc.identifier.urihttp://hdl.handle.net/2117/188711
dc.descriptionThis paper deals with the average complexity of Robinson's unification algorithm, for a simple case of unification; trees with all internal nodes of the same type, and two kinds of leaves.
dc.description.abstractWe compute the average complexity of Robinson's unification algorithm on the case of binary functions with two variables. When restricting the input to unifiable instances, the resulting complexity is linear on the size of the input.
dc.format.extent8 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-88-8
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshComputer programming
dc.subject.otherUnification
dc.subject.otherAverage analysis
dc.titleAverage case analysis of Robinson's unification algorithm with two different variables
dc.typeExternal research report
dc.subject.lemacProgramació (Ordinadors)
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
local.identifier.drac28486153
dc.description.versionPostprint (published version)
local.citation.authorCases, R.; Diaz, J.; Steyaert, J.


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple