Immunity and simplicity in relativizations of probabilistic complexity classes

The existence of immune and simple sets in relativizations of the probabilistic polynomial time bounded classes is studied. Some techniques previously used to show similar results for relativizations of P and NP are adapted to the probabilistic classes. Using these results, an exhaustive settling of...

Descripción completa

Detalles Bibliográficos
Autores: Balcázar Navarro, José Luis|||0000-0003-4248-4528, Russo, David A.
Tipo de recurso: artículo
Fecha de publicación:1988
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/103554
Acceso en línea:https://hdl.handle.net/2117/103554
Access Level:acceso abierto
Palabra clave:Complexity, Computational
Complexity
Immunity
Simplicity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
id ES_e5fa91f9f62c287352ae79c0b7e00e4c
oai_identifier_str oai:upcommons.upc.edu:2117/103554
network_acronym_str ES
network_name_str España
repository_id_str
spelling Immunity and simplicity in relativizations of probabilistic complexity classesBalcázar Navarro, José Luis|||0000-0003-4248-4528Russo, David A.Complexity, ComputationalComplexityImmunitySimplicityComplexitat computacionalÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitatThe existence of immune and simple sets in relativizations of the probabilistic polynomial time bounded classes is studied. Some techniques previously used to show similar results for relativizations of P and NP are adapted to the probabilistic classes. Using these results, an exhaustive settling of all possible strong separations among these relativized classes is obtained.On étudie les relativisations des classes de complexité probabiliste polynômiale. On adapte aux classes probabilistes des techniques déjà utilisées pour établir des résultats similaires pour les relativisations de P et NP. On obtient à partir de ces résultats une classification de toutes les propriétés de séparation forte pour ces classes relativisées.Peer Reviewed19881988-05-0120172017-04-19journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/103554reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/1035542026-05-27T15:37:01Z
dc.title.none.fl_str_mv Immunity and simplicity in relativizations of probabilistic complexity classes
title Immunity and simplicity in relativizations of probabilistic complexity classes
spellingShingle Immunity and simplicity in relativizations of probabilistic complexity classes
Balcázar Navarro, José Luis|||0000-0003-4248-4528
Complexity, Computational
Complexity
Immunity
Simplicity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
title_short Immunity and simplicity in relativizations of probabilistic complexity classes
title_full Immunity and simplicity in relativizations of probabilistic complexity classes
title_fullStr Immunity and simplicity in relativizations of probabilistic complexity classes
title_full_unstemmed Immunity and simplicity in relativizations of probabilistic complexity classes
title_sort Immunity and simplicity in relativizations of probabilistic complexity classes
dc.creator.none.fl_str_mv Balcázar Navarro, José Luis|||0000-0003-4248-4528
Russo, David A.
author Balcázar Navarro, José Luis|||0000-0003-4248-4528
author_facet Balcázar Navarro, José Luis|||0000-0003-4248-4528
Russo, David A.
author_role author
author2 Russo, David A.
author2_role author
dc.subject.none.fl_str_mv Complexity, Computational
Complexity
Immunity
Simplicity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
topic Complexity, Computational
Complexity
Immunity
Simplicity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
description The existence of immune and simple sets in relativizations of the probabilistic polynomial time bounded classes is studied. Some techniques previously used to show similar results for relativizations of P and NP are adapted to the probabilistic classes. Using these results, an exhaustive settling of all possible strong separations among these relativized classes is obtained.
publishDate 1988
dc.date.none.fl_str_mv 1988
1988-05-01
2017
2017-04-19
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/103554
url https://hdl.handle.net/2117/103554
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
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
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_ 1869422726822756353
score 15,198674

Similares en LA Referencia