Quiz games as a model for information hiding
We present a general computation model inspired in the notion of information hiding in software engineering. This model has the form of a game which we call quiz game. It allows in a uniform way to prove exponential lower bounds for several complexity problems. © 2016 Elsevier Inc. All rights reserv...
Guardado en:
| Autor principal: | Matera, Guillermo |
|---|---|
| Publicado: |
2016
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0885064X_v34_n_p1_Bank http://hdl.handle.net/20.500.12110/paper_0885064X_v34_n_p1_Bank |
| Aporte de: |
Ejemplares similares
-
Quiz games as a model for information hiding
por: Bank, B., et al. -
Lower complexity bounds for interpolation algorithms
por: Gimnez, N., et al. -
Lower complexity bounds for interpolation algorithms
Publicado: (2011) -
Some lower bounds for the complexity of the linear programming feasibility problem over the reals
Publicado: (2009) -
Some lower bounds for the complexity of the linear programming feasibility problem over the reals
por: Grimson, R., et al.