2004 | ||
---|---|---|
3 | EE | Harold S. Connamacher, Michael Molloy: The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem. FOCS 2004: 590-599 |
2 | EE | Harold S. Connamacher: A Random Constraint Satisfaction Problem That Seems Hard for DPLL. SAT 2004 |
2003 | ||
1 | EE | Harold S. Connamacher, Andrzej Proskurowski: The complexity of minimizing certain cost metrics for k-source spanning trees. Discrete Applied Mathematics 131(1): 113-127 (2003) |
1 | Michael Molloy (Michael S. O. Molloy) | [3] |
2 | Andrzej Proskurowski | [1] |