Extension of the hierarchy for k-OBDDs of small width

Extension of the hierarchy for k-OBDDs of small width

In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of representation of the k-OBDD computation process as an “automata-communication protocol” computation process. Our method allows us to extend the hierarchy proved by Bolling-Sauerhoff-Sieling-Wegener in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Russian mathematics 2013-03, Vol.57 (3), p.46-50
Hauptverfasser: Ablayev, F. M., Khadiev, K. R.
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics
Mathematics and Statistics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 50
container_issue 3
container_start_page 46
container_title Russian mathematics
container_volume 57
creator Ablayev, F. M.
Khadiev, K. R.
description In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of representation of the k-OBDD computation process as an “automata-communication protocol” computation process. Our method allows us to extend the hierarchy proved by Bolling-Sauerhoff-Sieling-Wegener in 1996 for k-OBDDs. Moreover, using the PJM function (a modification of well-known PJ and ISA functions), we prove a new hierarchy.
doi_str_mv 10.3103/S1066369X13030067
format Article
fullrecord <record><control><sourceid>crossref_sprin</sourceid><recordid>TN_cdi_crossref_primary_10_3103_S1066369X13030067</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_3103_S1066369X13030067</sourcerecordid><originalsourceid>FETCH-LOGICAL-c288t-66d42b8dc2b7f8a11895ea90b1a5bef995462c12ceb9e0649f6984a344c49fb43</originalsourceid><addsrcrecordid>eNp9j81KAzEURoMoWKsP4C4vEL35mTRZalurUOhChe6GJJM4U6czkoxo394MdSe4uh-cey73Q-iawg2nwG-fKUjJpd5SDhxAzk7QhGouiKKwPc05YzLyc3SR0g6gkEzICSqW34PvUtN3uA94qD2uGx9NdPUBhz7id7K5XyzSCNPetC3-aqqhvkRnwbTJX_3OKXp9WL7MH8l6s3qa362JY0oNRMpKMKsqx-wsKEOp0oU3Giw1hfVB60JI5ihz3moPUuggtRKGC-FytoJPET3edbFPKfpQfsRmb-KhpFCOvcs_vbPDjk7Ku92bj-Wu_4xdfvMf6Qc5iFka</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Extension of the hierarchy for k-OBDDs of small width</title><source>SpringerLink Journals</source><creator>Ablayev, F. M. ; Khadiev, K. R.</creator><creatorcontrib>Ablayev, F. M. ; Khadiev, K. R.</creatorcontrib><description>In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of representation of the k-OBDD computation process as an “automata-communication protocol” computation process. Our method allows us to extend the hierarchy proved by Bolling-Sauerhoff-Sieling-Wegener in 1996 for k-OBDDs. Moreover, using the PJM function (a modification of well-known PJ and ISA functions), we prove a new hierarchy.</description><identifier>ISSN: 1066-369X</identifier><identifier>EISSN: 1934-810X</identifier><identifier>DOI: 10.3103/S1066369X13030067</identifier><language>eng</language><publisher>Heidelberg: Allerton Press, Inc</publisher><subject>Mathematics ; Mathematics and Statistics</subject><ispartof>Russian mathematics, 2013-03, Vol.57 (3), p.46-50</ispartof><rights>Allerton Press, Inc. 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c288t-66d42b8dc2b7f8a11895ea90b1a5bef995462c12ceb9e0649f6984a344c49fb43</citedby><cites>FETCH-LOGICAL-c288t-66d42b8dc2b7f8a11895ea90b1a5bef995462c12ceb9e0649f6984a344c49fb43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.3103/S1066369X13030067$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.3103/S1066369X13030067$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Ablayev, F. M.</creatorcontrib><creatorcontrib>Khadiev, K. R.</creatorcontrib><title>Extension of the hierarchy for k-OBDDs of small width</title><title>Russian mathematics</title><addtitle>Russ Math</addtitle><description>In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of representation of the k-OBDD computation process as an “automata-communication protocol” computation process. Our method allows us to extend the hierarchy proved by Bolling-Sauerhoff-Sieling-Wegener in 1996 for k-OBDDs. Moreover, using the PJM function (a modification of well-known PJ and ISA functions), we prove a new hierarchy.</description><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><issn>1066-369X</issn><issn>1934-810X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp9j81KAzEURoMoWKsP4C4vEL35mTRZalurUOhChe6GJJM4U6czkoxo394MdSe4uh-cey73Q-iawg2nwG-fKUjJpd5SDhxAzk7QhGouiKKwPc05YzLyc3SR0g6gkEzICSqW34PvUtN3uA94qD2uGx9NdPUBhz7id7K5XyzSCNPetC3-aqqhvkRnwbTJX_3OKXp9WL7MH8l6s3qa362JY0oNRMpKMKsqx-wsKEOp0oU3Giw1hfVB60JI5ihz3moPUuggtRKGC-FytoJPET3edbFPKfpQfsRmb-KhpFCOvcs_vbPDjk7Ku92bj-Wu_4xdfvMf6Qc5iFka</recordid><startdate>20130301</startdate><enddate>20130301</enddate><creator>Ablayev, F. M.</creator><creator>Khadiev, K. R.</creator><general>Allerton Press, Inc</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20130301</creationdate><title>Extension of the hierarchy for k-OBDDs of small width</title><author>Ablayev, F. M. ; Khadiev, K. R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c288t-66d42b8dc2b7f8a11895ea90b1a5bef995462c12ceb9e0649f6984a344c49fb43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ablayev, F. M.</creatorcontrib><creatorcontrib>Khadiev, K. R.</creatorcontrib><collection>CrossRef</collection><jtitle>Russian mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ablayev, F. M.</au><au>Khadiev, K. R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Extension of the hierarchy for k-OBDDs of small width</atitle><jtitle>Russian mathematics</jtitle><stitle>Russ Math</stitle><date>2013-03-01</date><risdate>2013</risdate><volume>57</volume><issue>3</issue><spage>46</spage><epage>50</epage><pages>46-50</pages><issn>1066-369X</issn><eissn>1934-810X</eissn><abstract>In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of representation of the k-OBDD computation process as an “automata-communication protocol” computation process. Our method allows us to extend the hierarchy proved by Bolling-Sauerhoff-Sieling-Wegener in 1996 for k-OBDDs. Moreover, using the PJM function (a modification of well-known PJ and ISA functions), we prove a new hierarchy.</abstract><cop>Heidelberg</cop><pub>Allerton Press, Inc</pub><doi>10.3103/S1066369X13030067</doi><tpages>5</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1066-369X
ispartof Russian mathematics, 2013-03, Vol.57 (3), p.46-50
issn 1066-369X
1934-810X
language eng
recordid cdi_crossref_primary_10_3103_S1066369X13030067
source SpringerLink Journals
subjects Mathematics
Mathematics and Statistics
title Extension of the hierarchy for k-OBDDs of small width
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T12%3A50%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Extension%20of%20the%20hierarchy%20for%20k-OBDDs%20of%20small%20width&rft.jtitle=Russian%20mathematics&rft.au=Ablayev,%20F.%20M.&rft.date=2013-03-01&rft.volume=57&rft.issue=3&rft.spage=46&rft.epage=50&rft.pages=46-50&rft.issn=1066-369X&rft.eissn=1934-810X&rft_id=info:doi/10.3103/S1066369X13030067&rft_dat=%3Ccrossref_sprin%3E10_3103_S1066369X13030067%3C/crossref_sprin%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true