The Light Lexicographic path Ordering

Simple item page
dc.creatorCichon, E. A.
dc.creatorMarion, J-Y.
dc.date2000-10-03
dc.date.accessioned2026-07-07T03:16:36Z
dc.date.available2026-07-07T03:16:36Z
dc.descriptionWe introduce syntactic restrictions of the lexicographic path ordering to obtain the Light Lexicographic Path Ordering. We show that the light lexicographic path ordering leads to a characterisation of the functions computable in space bounded by a polynomial in the size of the inputs.
dc.identifierhttps://arxiv.org/abs/cs/0010008
dc.identifierhttp://arxiv.org/abs/cs/0010008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30415
dc.subjectProgramming Languages
dc.subjectComputational Complexity
dc.subjectF.1.3; I.2.2
dc.titleThe Light Lexicographic path Ordering
dc.typetext

Files

Collections

arXiv