Quiz Games as a model for Information Hiding
classification
🧮 math.AG
keywords
modelgamehidinginformationquizallowsboundscall
read the original abstract
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 of elimination theory.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.