Linearizing bad sequences: Upper bounds for the product and majoring well quasi-orders

Well quasi-orders (wqo's) are an important mathematical tool for proving termination of many algorithms. Under some assumptions upper bounds for the computational complexity of such algorithms can be extracted by analyzing the length of controlled bad sequences. We develop a new, self-contained...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Abriola, S., Figueira, S., Senno, G.
Formato: SER
Materias:
Data tree
Decision procedure
Mathematical tools
Multi-sets
Product ordering
Upper Bound
Algorithms
Trees (mathematics)
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v7456LNCS_n_p110_Abriola
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares