Polynomial size circuits with low resource-bounded Kolmogorov complexity

It is well-known that the class P/poly can be characterized in terms of polynomial size circuits. We obtain a characterization of the class P/log using polynomial size circuits with low resource-bounded Kolmogorov Complexity. The concept of "small circuits with easy descriptions" has been...

Descripción completa

Detalles Bibliográficos
Autores: Hermo Huguet, Montserrat, Mayordomo, Elvira
Tipo de recurso: informe técnico
Fecha de publicación:1991
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/329306
Acceso en línea:https://hdl.handle.net/2117/329306
Access Level:acceso abierto
Palabra clave:Polynomials
Polinomis
Àrees temàtiques de la UPC::Informàtica
id ES_d1ccbec7d5ae33a7a74e88c291fe18b2
oai_identifier_str oai:upcommons.upc.edu:2117/329306
network_acronym_str ES
network_name_str España
repository_id_str
spelling Polynomial size circuits with low resource-bounded Kolmogorov complexityHermo Huguet, MontserratMayordomo, ElviraPolynomialsPolinomisÀrees temàtiques de la UPC::InformàticaIt is well-known that the class P/poly can be characterized in terms of polynomial size circuits. We obtain a characterization of the class P/log using polynomial size circuits with low resource-bounded Kolmogorov Complexity. The concept of "small circuits with easy descriptions" has been introduced in the literature as a candidate to characterizing P/log. We prove that this concept doesn't correspond exactly to P/log but to P/O(log n * log(log n)), and that this class is different from the previous one. Generalizations of this result are also obtained.19911991-06-0120202020-09-28reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/329306reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivs 3.0 Spainhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/3293062026-05-27T15:37:01Z
dc.title.none.fl_str_mv Polynomial size circuits with low resource-bounded Kolmogorov complexity
title Polynomial size circuits with low resource-bounded Kolmogorov complexity
spellingShingle Polynomial size circuits with low resource-bounded Kolmogorov complexity
Hermo Huguet, Montserrat
Polynomials
Polinomis
Àrees temàtiques de la UPC::Informàtica
title_short Polynomial size circuits with low resource-bounded Kolmogorov complexity
title_full Polynomial size circuits with low resource-bounded Kolmogorov complexity
title_fullStr Polynomial size circuits with low resource-bounded Kolmogorov complexity
title_full_unstemmed Polynomial size circuits with low resource-bounded Kolmogorov complexity
title_sort Polynomial size circuits with low resource-bounded Kolmogorov complexity
dc.creator.none.fl_str_mv Hermo Huguet, Montserrat
Mayordomo, Elvira
author Hermo Huguet, Montserrat
author_facet Hermo Huguet, Montserrat
Mayordomo, Elvira
author_role author
author2 Mayordomo, Elvira
author2_role author
dc.subject.none.fl_str_mv Polynomials
Polinomis
Àrees temàtiques de la UPC::Informàtica
topic Polynomials
Polinomis
Àrees temàtiques de la UPC::Informàtica
description It is well-known that the class P/poly can be characterized in terms of polynomial size circuits. We obtain a characterization of the class P/log using polynomial size circuits with low resource-bounded Kolmogorov Complexity. The concept of "small circuits with easy descriptions" has been introduced in the literature as a candidate to characterizing P/log. We prove that this concept doesn't correspond exactly to P/log but to P/O(log n * log(log n)), and that this class is different from the previous one. Generalizations of this result are also obtained.
publishDate 1991
dc.date.none.fl_str_mv 1991
1991-06-01
2020
2020-09-28
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/329306
url https://hdl.handle.net/2117/329306
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869420294882459648
score 15.198674

Similares en LA Referencia