On the Computational Complexity of Information Hiding

In this work we study the intrinsic complexity of elimination algorithms in effective algebraic geometry and we focus our attention to elimination algorithms produced within the object–oriented paradigm. To this end, we describe a new computation model called quiz game (introduced in [1]) which mode...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Rojas Paredes, Andrés
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2017
Materias:
Ciencias Informáticas
abstract data type
information hiding
non– functional requirement
scientific computing
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/65161
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares