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: Paredes, A.R.
Formato: JOUR
Materias:
Abstract data types
Algebra
Computer games
Software engineering
Turing machines
Abstraction functions
Algebraic complexity theories
Algebraic geometry
Computation model
Functional requirement
Identity functions
Information hiding
Quantifier elimination
Computational complexity
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_15710661_v339_n_p135_Paredes
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares