Quiz games as a model for information hiding

DOI10.1016/j.jco.2015.11.005zbMath1352.68084arXiv1508.07842OpenAlexW2198611549MaRDI QIDQ272185

José Luis Montaña, Andrés Rojas Paredes, Guillermo Matera, Bernd Bank, Joos Heintz, Luis Miguel Pardo

Publication date: 20 April 2016

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.07842

zbMATH Keywords

neural networkinterpolation problemelimination problemgeometrically robust constructible maplower complexity boundquiz game

Mathematics Subject Classification ID

Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

An unfeasibility view of neural network learning, On the bit complexity of polynomial system solving, An algorithm for reversible information hiding of encrypted medical images in homomorphic encrypted domain

Uses Software

• Eiffel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The red book of varieties and schemes
• The hardness of polynomial equation solving
• Lower bound for the approximative complexity
• Software engineering and complexity in effective algebraic geometry
• Lower complexity bounds for interpolation algorithms
• Generic local structure of the morphisms in commutative algebra
• On the intrinsic complexity of elimination problems in effective algebraic geometry