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...

ver descrição completa

Detalhes bibliográficos
Autores: Gavaldà Mestre, Ricard|||0000-0003-4736-7179, Guijarro Guillem, David
Formato: informe técnico
Fecha de publicación:1995
País:España
Recursos: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
Acesso em linha:https://hdl.handle.net/2117/82261
Access Level:acceso abierto
Palavra-chave: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
spelling Learning ordered binary decision diagrams Gavaldà Mestre, Ricard|||0000-0003-4736-7179 Guijarro Guillem, David Obdds Ordered binary decision diagrams Àrees temàtiques de la UPC::Informàtica 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. https://hdl.handle.net/2117/82261
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
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
topic Obdds
Ordered binary decision diagrams
Àrees temàtiques de la UPC::Informàtica
topic_facet 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
format report
url https://hdl.handle.net/2117/82261
language eng
eu_rights_str_mv openAccess
institution Universitat Politècnica de Catalunya (UPC)
collection UPCommons. Portal del coneixement obert de la UPC
reponame_str UPCommons. Portal del coneixement obert de la UPC
instname_str Universitat Politècnica de Catalunya (UPC)
_version_ 1878438985399795712
publishDateSort 1995
author_browse Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Guijarro Guillem, David
score 6,9303427

Registos relacionados