| Presentation | 2004-12-10 Another Proof for an Upper Bound of a Local Search Algorithm for 3-SAT Masaki YAMAMOTO, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We present another proof for an upper bound of a deterministic local search algorithm by Dantsin et. al. for 3-SAT. This bound O (1.481^n) is currently no longer the best (where n is the number of variables) while the best bound is slightly better : O (1.473^n) due to Brueggemann and Kern. We also indicate a possibility to achieve the currently best bound. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Satisfiability Problem / 3-SAT / Local Search |
| Paper # | COMP2004-54 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2004/12/3(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) | Another Proof for an Upper Bound of a Local Search Algorithm for 3-SAT |
| Sub Title (in English) | |
| Keyword(1) | Satisfiability Problem |
| Keyword(2) | 3-SAT |
| Keyword(3) | Local Search |
| 1st Author's Name | Masaki YAMAMOTO |
| 1st Author's Affiliation | Tokyo Institute of Technology, Dept. of Mathematical Computing Sciences() |
| Date | 2004-12-10 |
| Paper # | COMP2004-54 |
| Volume (vol) | vol.104 |
| Number (no) | 501 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |