El problema diofántico de Frobenius

dc.contributor.advisor	Tornero Sánchez, José María	es
dc.creator	Chacón Gómez, Manuel Jesús	es
dc.date.accessioned	2017-01-03T08:41:56Z
dc.date.available	2017-01-03T08:41:56Z
dc.date.issued	2016-12
dc.identifier.citation	Chacón Gómez, M.J. (2016). El problema diofántico de Frobenius. (Trabajo fin de grado inédito). Universidad de Sevilla, Sevilla.
dc.identifier.uri	http://hdl.handle.net/11441/51402
dc.description.abstract	In this work, we study the diophantine Frobenius problem. First, in Chapter 1, we briefly present what are numerical semigroups and we see what is the Frobenius number. By the end of this chapter we show that the Frobenius problem is NP-hard. Afterwards, in Chapter 2, we study the Frobenius problem for small n. Finally, in the last chapter, we give some algorithms to solve the general Frobenius problem.	es
dc.format	application/pdf	es
dc.language.iso	spa	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	El problema diofántico de Frobenius	es
dc.type	info:eu-repo/semantics/bachelorThesis	es
dc.type.version	info:eu-repo/semantics/publishedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
dc.contributor.affiliation	Universidad de Sevilla. Departamento de álgebra	es
dc.description.degree	Universidad de Sevilla. Grado en Matemáticas	es
idus.format.extent	56 p.	es

Ficheros	Tamaño	Formato	Ver	Descripción
Chacón Gómez Manuel Jesús TFG.pdf	736.3Kb	[PDF]	Ver/Abrir

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional