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
id I19-R120-10915-65161
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
abstract data type
information hiding
non– functional requirement
scientific computing
spellingShingle Ciencias Informáticas
abstract data type
information hiding
non– functional requirement
scientific computing
Rojas Paredes, Andrés
On the Computational Complexity of Information Hiding
topic_facet Ciencias Informáticas
abstract data type
information hiding
non– functional requirement
scientific computing
description 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 models the notions of information hiding (due to Parnas, see [2]) and non–functional requirements (e.g. robustness) among other important concepts in software engineering. This characteristic distinguish our model from classical computation models such as the Turing machine or algebraic models. We illustrate our computation model with a non–trivial complexity lower bound for the identity function of polynomials. We show that any object–oriented (and robust) implementation of the identity function of polynomials is necessarily inefficient compared with a trivial implementation of this function. This result shows an existing synergy between Software Engineering and Algebraic Complexity Theory.
format Objeto de conferencia
Objeto de conferencia
author Rojas Paredes, Andrés
author_facet Rojas Paredes, Andrés
author_sort Rojas Paredes, Andrés
title On the Computational Complexity of Information Hiding
title_short On the Computational Complexity of Information Hiding
title_full On the Computational Complexity of Information Hiding
title_fullStr On the Computational Complexity of Information Hiding
title_full_unstemmed On the Computational Complexity of Information Hiding
title_sort on the computational complexity of information hiding
publishDate 2017
url http://sedici.unlp.edu.ar/handle/10915/65161
work_keys_str_mv AT rojasparedesandres onthecomputationalcomplexityofinformationhiding
bdutipo_str Repositorios
_version_ 1764820480199491584

Ejemplares similares