{"id":139699,"date":"2026-01-12T17:48:00","date_gmt":"2026-01-12T17:48:00","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/sin-categoria\/cotas-inferiores-para-problemas-decisionales-en-teoria-de-complejidad-algebraica\/"},"modified":"2026-01-12T17:48:00","modified_gmt":"2026-01-12T17:48:00","slug":"cotas-inferiores-para-problemas-decisionales-en-teoria-de-complejidad-algebraica","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/matematicas\/cotas-inferiores-para-problemas-decisionales-en-teoria-de-complejidad-algebraica\/","title":{"rendered":"Cotas inferiores para problemas decisionales en teoria de complejidad algebraica"},"content":{"rendered":"<h2>Tesis doctoral de <strong>  Monta\u00f1a Arnaiz Jos\u00e9 Luis <\/strong><\/h2>\n<p>La tesis versa sobre la obtencion de cotas inferiores en teoria de complejidad algebraica. Utilizando modelos de computacion decisionales se han mostrado cotas inferiores del tipo  (n) para problemas de optimizacion finita sobre el conjunto de los numeros reales. Se han obtenido cotas inferiores para la complejidad no escalar que proporcionan cotas inferiores del tipo  (nlog2n) para ciertos problemas de proximidad.  se ha analizado un modelo de computacion uniforme sobre los reales: las maquinas de blum, shub y smale, mostrando una interpretacion geometrica de la clase de lenguajes reconocidos por maquinas cuya funcion de tiempo esta definida. Se han demostrado teoremas de jerarquia de tiempo dentro de dicha clase.  se ha establecido un modelo de computacion uniforme para la computacion paralela sobre los reales, obteniendose cotas inferiores topologicas para este modelo.  finalmente se ha estudiado la influencia de la teoria de complejidad algebraica en topolog\u00eda y teoria de la aproximacion.<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>Cotas inferiores para problemas decisionales en teoria de complejidad algebraica<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 Cotas inferiores para problemas decisionales en teoria de complejidad algebraica <\/li>\n<li><strong>Autor:<\/strong>\u00a0  Monta\u00f1a Arnaiz Jos\u00e9 Luis <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 Cantabria<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 01\/01\/1992<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<h3>Direcci\u00f3n y tribunal<\/h3>\n<ul>\n<li><strong>Director de la tesis<\/strong>\n<ul>\n<li>Tomas Recio Mu\u00f1iz<\/li>\n<\/ul>\n<\/li>\n<li><strong>Tribunal<\/strong>\n<ul>\n<li>Presidente del tribunal: Jos\u00e9 Luis Balcazar Navarro <\/li>\n<li> Von Zur Gaten Joachim (vocal)<\/li>\n<li>Joos Heintz (vocal)<\/li>\n<li>Felipe Cucker Farkas (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Monta\u00f1a Arnaiz Jos\u00e9 Luis La tesis versa sobre la obtencion de cotas inferiores en teoria de complejidad [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"footnotes":""},"categories":[2809,10518,1890,5301,30372,126],"tags":[15629,10524,15865,172568,3530,254224],"class_list":["post-139699","post","type-post","status-publish","format-standard","hentry","category-algebra","category-cantabria","category-ciencia-de-los-ordenadores","category-geometria-algebraica","category-lenguajes-algoritmicos","category-matematicas","tag-felipe-cucker-farkas","tag-joos-heintz","tag-jose-luis-balcazar-navarro","tag-montana-arnaiz-jose-luis","tag-tomas-recio-muniz","tag-von-zur-gaten-joachim"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/139699","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/comments?post=139699"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/139699\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=139699"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=139699"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=139699"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}