The resolution complexity of random graph ::::k::::-colorability

Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore. The resolution complexity of random graph ::::k::::-colorability. Discrete Applied Mathematics, 153(1-3):25-47, 2005. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.