Timeline for Maximizing the number of 'correct' literals in planar monotone 3SAT
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 3, 2011 at 1:14 | comment | added | Gerhard Paseman | If you ask for an assignment for which the instance evaluates to 1, it is probably something like #P-hard to get one and maximize the sum as well. Gerhard "Ask Me About System Design" Paseman, 2011.03.02 | |
| Mar 3, 2011 at 1:12 | comment | added | Gerhard Paseman | It should be polynomial time to maximize the given sum. Add both sums together and find which literals occur negatively more often than positively, and vice versa. Unless you meant something else? Gerhard "Ask Me About System Design" Paseman, 2011.03.02 | |
| Mar 3, 2011 at 1:07 | history | asked | Michael Biro | CC BY-SA 2.5 |