| Presentation | 1999/10/25 Checking Ordered Tree-Shellability of Boolean Functions Based on OBDDs Yasuhiko TAKENAGA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper, we consider the complexity of checking ordered tree-shellability of a Boolean function given as an OBDD. An ordered tree-shellable function is a positive Boolean function such that the number of prime implicants equals the number of paths from the root node to a 1-node in its ordered binary decision tree representation. We show that given an OBDD, it is possible to check within polynomial time if the function is ordered tree-shellable with respect to the variable ordering of the OBDD. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | ordered binary decision diagram (OBDD) / tree-shellable function / prime implicant |
| Paper # | COMP99-47 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1999/10/25(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Checking Ordered Tree-Shellability of Boolean Functions Based on OBDDs |
| Sub Title (in English) | |
| Keyword(1) | ordered binary decision diagram (OBDD) |
| Keyword(2) | tree-shellable function |
| Keyword(3) | prime implicant |
| 1st Author's Name | Yasuhiko TAKENAGA |
| 1st Author's Affiliation | Department of Computer Science, University of Electro-Communications() |
| Date | 1999/10/25 |
| Paper # | COMP99-47 |
| Volume (vol) | vol.99 |
| Number (no) | 388 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |