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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Matera, Guillermo
Publicado: 2016
Materias:
Elimination problem
Geometrically robust constructible map
Interpolation problem
Lower complexity bound
Neural network
Quiz game
Neural networks
Software engineering
Computation model
Information hiding
Interpolation problems
Lower bounds
Lower complexity
Complex networks
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:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
Descripción
Sumario: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 reserved.

Ejemplares similares