Quiz Games as a model for Information Hiding
Bernd Bank, Joos Heintz, Guillermo Matera, Jose L. Montana, Luis M., Pardo, Andres Rojas Paredes
TL;DR
This paper introduces a quiz game model inspired by information hiding in software engineering, providing a unified framework to establish exponential lower bounds for various complexity problems in elimination theory.
Contribution
The paper proposes a novel game-based computation model that generalizes information hiding concepts to analyze complexity bounds in elimination theory.
Findings
Established exponential lower bounds for multiple complexity problems
Unified approach to analyze complexity via quiz game model
Applicable to various problems in elimination theory
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.