On some "non uniform" complexity measures
Non-uniform complexity measures origined in Automata and Formal Languages Theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1985 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/110729 |
| Acceso en línea: | https://hdl.handle.net/2117/110729 |
| Access Level: | acceso abierto |
| Palabra clave: | Complexity, Computational Complexitat computacional Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
| Sumario: | Non-uniform complexity measures origined in Automata and Formal Languages Theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits straight line programs, and Turing machines with sparse oracles and time or space bounds. |
|---|