| Presentation | 2000/7/18 COMP2000-27 On the maximum satisfiability of random 3CNF formulae Mitsuo Motoki, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | For Maximum 3-Satisfiability Problem (MAX-3SAT), we discuss about the expected number of unsatisfiable clauses on optimal assignment. We proved two lower bounds theoretically. One is Ω(m / 1nm) for m>___-5.19n and the other is m / 8-O(√ |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | MAX-SAT / optimization problem / probabilistic analysis / average of optimal solution |
| Paper # | COMP2000-27 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2000/7/18(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) | COMP2000-27 On the maximum satisfiability of random 3CNF formulae |
| Sub Title (in English) | |
| Keyword(1) | MAX-SAT |
| Keyword(2) | optimization problem |
| Keyword(3) | probabilistic analysis |
| Keyword(4) | average of optimal solution |
| 1st Author's Name | Mitsuo Motoki |
| 1st Author's Affiliation | Dept. of Mathematical and Computing Sciences Tokyo Institute of Technology() |
| Date | 2000/7/18 |
| Paper # | COMP2000-27 |
| Volume (vol) | vol.100 |
| Number (no) | 216 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |