Learning ordered binary decision diagrams

We study the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering...

Descripción completa

Detalles Bibliográficos
Autores: Gavaldà Mestre, Ricard|||0000-0003-4736-7179, Guijarro Guillem, David
Tipo de recurso: informe técnico
Fecha de publicación:1995
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/82261
Acceso en línea:https://hdl.handle.net/2117/82261
Access Level:acceso abierto
Palabra clave:Obdds
Ordered binary decision diagrams
Àrees temàtiques de la UPC::Informàtica
id ES_a7e9d665da2d3e2ba0b38ebfff2a11ef
oai_identifier_str oai:upcommons.upc.edu:2117/82261
network_acronym_str ES
network_name_str España
repository_id_str
spelling Learning ordered binary decision diagramsGavaldà Mestre, Ricard|||0000-0003-4736-7179Guijarro Guillem, DavidObddsOrdered binary decision diagramsÀrees temàtiques de la UPC::InformàticaWe study the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output, unless P=NP. If learning has to occur with respect to the optimal variable ordering, polynomial-time learnability implies the approximability of two NP-hard optimization problems: the problem of finding the optimal variable ordering for a given obdd and the Optimal Linear Arrangement problem on graphs.19951995-03-0120162016-01-29reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/82261reponame: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/822612026-05-27T15:37:01Z
dc.title.none.fl_str_mv Learning ordered binary decision diagrams
title Learning ordered binary decision diagrams
spellingShingle Learning ordered binary decision diagrams
Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Obdds
Ordered binary decision diagrams
Àrees temàtiques de la UPC::Informàtica
title_short Learning ordered binary decision diagrams
title_full Learning ordered binary decision diagrams
title_fullStr Learning ordered binary decision diagrams
title_full_unstemmed Learning ordered binary decision diagrams
title_sort Learning ordered binary decision diagrams
dc.creator.none.fl_str_mv Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Guijarro Guillem, David
author Gavaldà Mestre, Ricard|||0000-0003-4736-7179
author_facet Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Guijarro Guillem, David
author_role author
author2 Guijarro Guillem, David
author2_role author
dc.subject.none.fl_str_mv Obdds
Ordered binary decision diagrams
Àrees temàtiques de la UPC::Informàtica
topic Obdds
Ordered binary decision diagrams
Àrees temàtiques de la UPC::Informàtica
description We study the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output, unless P=NP. If learning has to occur with respect to the optimal variable ordering, polynomial-time learnability implies the approximability of two NP-hard optimization problems: the problem of finding the optimal variable ordering for a given obdd and the Optimal Linear Arrangement problem on graphs.
publishDate 1995
dc.date.none.fl_str_mv 1995
1995-03-01
2016
2016-01-29
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/82261
url https://hdl.handle.net/2117/82261
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/postscript
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_ 1869415817437773824
score 15,301603

Similares en LA Referencia