American Psychological Association 6th edition

FRANCO, J. (2005, January 1). Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. 153(1-3). Amsterdam; Lausanne; New York, NY: Elsevier, 2005. Retrieved from http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17350529

ISO-690 (author-date, English)

FRANCO, John, 2005. Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. In: [online]. Amsterdam; Lausanne; New York, NY: Elsevier, 2005. 1 January 2005. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17350529

Modern Language Association 9th edition

FRANCO, J. Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. no. 1-3, Amsterdam; Lausanne; New York, NY: Elsevier, 2005., 2005, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17350529.

Mohr Siebeck - Recht (Deutsch - Österreich)

Emerald - Harvard

FRANCO, J. (2005), “Typical case complexity of Satisfiability Algorithms and the threshold phenomenon”, in , Vol. 153, Amsterdam; Lausanne; New York, NY: Elsevier, 2005., available at: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17350529.

Warning: These citations may not always be 100% accurate.