Work-sensitive Dynamic Complexity of Formal Languages

Which amount of parallel resources is needed for updating a query result after changing an input? In this work we study the amount of work required for dynamically answering membership and range queries for formal languages in parallel constant time with polynomially many processors. As a prerequisi...

Descripción completa

Detalles Bibliográficos
Autores principales: Schmidt, Jonas, Schwentick, Thomas, Tantau, Till, Vortmeier, Nils, Zeume, Thomas
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984110/
http://dx.doi.org/10.1007/978-3-030-71995-1_25
Descripción
Sumario:Which amount of parallel resources is needed for updating a query result after changing an input? In this work we study the amount of work required for dynamically answering membership and range queries for formal languages in parallel constant time with polynomially many processors. As a prerequisite, we propose a framework for specifying dynamic, parallel, constant-time programs that require small amounts of work. This framework is based on the dynamic descriptive complexity framework by Patnaik and Immerman.

Ejemplares similares