| Presentation | 2007-09-07 A Consideration on 3SAT Problem Kunikatsu KOBAYASHI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We examine a solving of 3SAT problem. By using t times operations over binary tree with depth n, we can decide whether 3SAT problem is satisfiable or not. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | 3SAT / NP complete / NP=P |
| Paper # | ISEC2007-82 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2007/8/31(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 | Information Security (ISEC) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Consideration on 3SAT Problem |
| Sub Title (in English) | |
| Keyword(1) | 3SAT |
| Keyword(2) | NP complete |
| Keyword(3) | NP=P |
| 1st Author's Name | Kunikatsu KOBAYASHI |
| 1st Author's Affiliation | Faculty of Engineering, Yamagata University() |
| Date | 2007-09-07 |
| Paper # | ISEC2007-82 |
| Volume (vol) | vol.107 |
| Number (no) | 209 |
| Page | pp.pp.- |
| #Pages | 3 |
| Date of Issue | |