Tree-shellability of restricted DNFs

被引：0
|
作者：
Takenaga, Yasuhiko [1 ]
Katougi, Nao [1 ]
机构：
[1] Univ Electrocommun, Dept Comp Sci, Chofu, Tokyo 1828585, Japan
来源：
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2008年 / E91D卷 / 04期
关键词：
Boolean function; shellability; prime implicant; binary decision tree;
D O I：
10.1093/ietisy/e91-d.4.996
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A tree-shellable function is a positive Boolean function which can be represented by a binary decision tree whose number of paths from the root to a leaf labeled 1 equals the number of prime implicants. In this paper, we consider the tree-shellability of DNFs with restrictions. We show that, for read-k DNFs, the number of terms in a tree-shellable function is at most k(2). We also show that, for k-DNFs, recognition of ordered tree-shellable functions is NP-complete for k = 4 and tree-shellable functions can be recognized in polynomial time for constant k.
引用
收藏
页码：996 / 1002
页数：7
相关论文
共 50 条
  • [41] Dynamic load balancing based on restricted multicast tree in homogeneous multiprocessor systems
    School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
    不详
    J Beijing Inst Technol Engl Ed, 2008, 2 (184-188):
  • [42] Multi-cloud service provision based on decision tree and two-layer Restricted Monte Carlo Tree Search
    Li, Wenjuan
    Cao, Jian
    Zhou, Bin
    Deng, Shuiguang
    Zhang, Qifei
    Hu, Keyong
    Li, Jing
    Zhao, Haili
    INTERNET OF THINGS, 2023, 22
  • [43] Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs
    Hoang-Oanh Le
    Van Bang Le
    Algorithmica, 2019, 81 : 4258 - 4274
  • [44] Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs
    Hoang-Oanh Le
    Van Bang Le
    ALGORITHMICA, 2019, 81 (11-12) : 4258 - 4274
  • [45] Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs
    Le, Hoang-Oanh
    Le, Van Bang
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, 10392 LNCS : 359 - 370
  • [46] Climate defined but not soil-restricted: the distribution of a Neotropical tree through space and time
    Alvarez, Facundo
    Morandi, Paulo S.
    Marimon-Junior, Ben Hur
    Exavier, Reginal
    Araujo, Igor
    Mariano, Lucas H.
    Muller, Angelica O.
    Feldpausch, Ted R.
    Marimon, Beatriz S.
    PLANT AND SOIL, 2022, 471 (1-2) : 175 - 191
  • [47] Attack-resistant Spanning Tree Construction in Route-Restricted Overlay Networks
    Byrenheid, Martin
    Roos, Stefanie
    Strufe, Thorsten
    2019 IEEE 38TH INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS 2019), 2019, : 251 - 260
  • [48] Climate defined but not soil-restricted: the distribution of a Neotropical tree through space and time
    Facundo Alvarez
    Paulo S. Morandi
    Ben Hur Marimon-Junior
    Reginal Exavier
    Igor Araújo
    Lucas H. Mariano
    Angélica O. Muller
    Ted R. Feldpausch
    Beatriz S. Marimon
    Plant and Soil, 2022, 471 : 175 - 191
  • [49] Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
    Truthe, Bianca
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2023, 386 : 253 - 268
  • [50] Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs
    Le, Hoang-Oanh
    Le, Van Bang
    COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 359 - 370
12345