| Presentation | 2001/11/9 Complexity of Recognizing Tree-Shellable Functions 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 recognizing tree-shellable Boolean functions. A tree-shellable function is a positive Boolean function such that the number of prime implicants equals the number of paths from the root to a 1-node in its binary decision tree representation. We show an algorithm to check if a function given as an irredundant DNF is tree-shellable or not. The computational time of the algorithm is O(kn^2k)orO(N^2k-2), where n is the number of variables, k is the maximun number of variables in a product term of the given DNF and N is the length of the DNF. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Boolean function / shellability / prime implicant / binary decision tree / paramaterized complexity |
| Paper # | COMP 2001-62 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2001/11/9(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 | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Complexity of Recognizing Tree-Shellable Functions |
| Sub Title (in English) | |
| Keyword(1) | Boolean function |
| Keyword(2) | shellability |
| Keyword(3) | prime implicant |
| Keyword(4) | binary decision tree |
| Keyword(5) | paramaterized complexity |
| 1st Author's Name | Yasuhiko TAKENAGA |
| 1st Author's Affiliation | Department of Comouter Science, The University of Electro-Communications() |
| Date | 2001/11/9 |
| Paper # | COMP 2001-62 |
| Volume (vol) | vol.101 |
| Number (no) | 431 |
| Page | pp.pp.- |
| #Pages | 7 |
| Date of Issue | |