Quiz games as a model for information hiding

Mostrar otras versiones (1)

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. © 2016 Elsevier Inc. All rights reserv...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Bank, B.
Otros Autores: Heintz, J., Matera, G., Montaña, J.L, Pardo, L.M, Rojas Paredes, A.
Formato: Capítulo de libro
Lenguaje:Inglés
Publicado: Academic Press Inc. 2016
Acceso en línea:Registro en Scopus
DOI
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
Biblioteca Central Dr. Luis F. Leloir (FCEN) de Universidad de Buenos Aires
LEADER 06046caa a22008057a 4500
001 PAPER-15944
003 AR-BaUEN
005 20230518204648.0
008 190411s2016 xx ||||fo|||| 00| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-84949024315 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
100 1 |a Bank, B. 
245 1 0 |a Quiz games as a model for information hiding 
260 |b Academic Press Inc.  |c 2016 
270 1 0 |m Heintz, J.; Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Ciudad Univ., Pab. I, Argentina; email: joos@dc.uba.ar 
506 |2 openaire  |e Política editorial 
504 |a Alder, A., (1984) Grenzrang und Grenzkomplexität Aus Algebraischer und Topologischer Sicht, , (Ph.D. thesis) Universität Zürich 
504 |a Bürgisser, P., Clausen, M., Shokrollahi, M.A., (1997) Algebraic Complexity Theory, 315. , Grundlehren Math. Wiss. Springer Berlin 
504 |a Castro, D., Giusti, M., Heintz, J., Matera, G., Pardo, L.M., The hardness of polynomial equation solving (2003) Found. Comput. Math., 3 (4), pp. 347-420 
504 |a Eisenbud, D., (1995) Commutative Algebra with A View Toward Algebraic Geometry, 150. , Grad. Texts in Math. Springer New York 
504 |a Fried, M., Jarden, M., (2005) Field Arithmetic, , second ed. Springer Berlin 
504 |a Giménez, N., Heintz, J., Matera, G., Solernó, P., Lower complexity bounds for interpolation algorithms (2011) J. Complexity, 27 (2), pp. 151-187 
504 |a Giusti, M., Heintz, J., Kronecker's smart, little black-boxes (2001) Proceedings of Foundations of Computational Mathematics, 284, pp. 69-104. , A. Iserles, R. Devore, E. Süli, FoCM'99, Oxford 1999 (Cambridge) London Math. Soc. Lecture Note Ser. Cambridge Univ. Press 
504 |a Griesser, B., Lower bounds for the approximative complexity (1986) Theoret. Comput. Sci., 46, pp. 329-338 
504 |a Hagan, M., Demuth, H., Beale, M., (1996) Neural Network Design, , PWS Publishing Company Boston, MA 
504 |a Haykin, S., Krogh, A., Palmer, R., (1999) Neural Networks, A Comprehensive Foundation, , second ed. Prentice Hall Upper Saddle River, NJ 
504 |a Heintz, J., Kuijpers, B., Rojas Paredes, A., On the intrinsic complexity of elimination problems in effective algebraic geometry (2013) Recent Advances in Real Complexity and Computation (Providence, RI), 604, pp. 129-150. , J.L. Montaña, L.M. Pardo, Contemp. Math. Amer. Math. Soc 
504 |a Heintz, J., Kuijpers, B., Rojas Paredes, A., Software engineering and complexity in effective algebraic geometry (2013) J. Complexity, 29 (1), pp. 92-138 
504 |a Hertz, J., Krogh, A., Palmer, R., (1991) Introduction to the Theory of Neural Computation, , Addison-Wesley Reading, Massachusetts 
504 |a Iversen, B., (1973) Generic Local Structure of the Morphisms in Commutative Algebra, 310. , Lecture Notes in Math. Springer New York 
504 |a Kunz, E., (1985) Introduction to Commutative Algebra and Algebraic Geometry, , Birkhäuser Boston 
504 |a Lickteig, T.M., (1990) On Semialgebraic Decision Complexity, Technical Report TR-90-052, , Int. Comput. Sci. Inst Berkeley 
504 |a Meyer, B., (1997) Object-oriented Software Construction, , second ed. Prentice-Hall, Inc. Upper Saddle River, NJ 
504 |a Mumford, D., (1988) The Red Book of Varieties and Schemes, 1358. , first ed. Lecture Notes in Math. Springer New York 
504 |a Shafarevich, I.R., (1994) Basic Algebraic Geometry: Varieties in Projective Space, , Springer Berlin Heidelberg New York 
520 3 |a 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. © 2016 Elsevier Inc. All rights reserved.  |l eng 
593 |a Humboldt-Universität zu Berlin, Institut für Mathematik, Berlin, 10099, Germany 
593 |a Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Ciudad Univ., Pab. I, Buenos Aires, 1428, Argentina 
593 |a National Council of Science and Technology (CONICET), Argentina 
593 |a Instituto Del Desarrollo Humano, Universidad Nacional General Sarmiento, J. M. Gutiérrez 1150 (B1613GSX) Los Polvorines, Provincia de Buenos Aires, Argentina 
593 |a Departamento de Matemáticas, Estadística y Computación, Facultad de Ciencias, Universidad de Cantabria, Santander, 39071, Spain 
690 1 0 |a ELIMINATION PROBLEM 
690 1 0 |a GEOMETRICALLY ROBUST CONSTRUCTIBLE MAP 
690 1 0 |a INTERPOLATION PROBLEM 
690 1 0 |a LOWER COMPLEXITY BOUND 
690 1 0 |a NEURAL NETWORK 
690 1 0 |a QUIZ GAME 
690 1 0 |a NEURAL NETWORKS 
690 1 0 |a SOFTWARE ENGINEERING 
690 1 0 |a COMPUTATION MODEL 
690 1 0 |a ELIMINATION PROBLEM 
690 1 0 |a INFORMATION HIDING 
690 1 0 |a INTERPOLATION PROBLEMS 
690 1 0 |a LOWER BOUNDS 
690 1 0 |a LOWER COMPLEXITY 
690 1 0 |a QUIZ GAME 
690 1 0 |a COMPLEX NETWORKS 
700 1 |a Heintz, J. 
700 1 |a Matera, G. 
700 1 |a Montaña, J.L. 
700 1 |a Pardo, L.M. 
700 1 |a Rojas Paredes, A. 
773 0 |d Academic Press Inc., 2016  |g v. 34  |h pp. 1-29  |p J. Complexity  |x 0885064X  |t Journal of Complexity 
856 4 1 |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-84949024315&doi=10.1016%2fj.jco.2015.11.005&partnerID=40&md5=2e12860da53fee25146d2dd9e5034cae  |y Registro en Scopus 
856 4 0 |u https://doi.org/10.1016/j.jco.2015.11.005  |y DOI 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_0885064X_v34_n_p1_Bank  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0885064X_v34_n_p1_Bank  |y Registro en la Biblioteca Digital 
961 |a paper_0885064X_v34_n_p1_Bank  |b paper  |c PE 
962 |a info:eu-repo/semantics/article  |a info:ar-repo/semantics/artículo  |b info:eu-repo/semantics/publishedVersion 
999 |c 76897 

Ejemplares similares