@inbook{gurevich1989the,
author = {Gurevich, Yuri},
title = {The Challenger-Solver game: Variations on the theme of P =?NP},
booktitle = {Chapter in "Current Trends in Theoretical Computer Science", Eds. G. Rozenberg and A. Salomaa, World Scientific, Series in Computer Science},
year = {1989},
month = {October},
abstract = {Originally in Bulletin of the European Association for Theoretical Computer Science October 1989, 112-121. Reprinted in 1993 World Scientific book Current Trends in Theoretical Computer Science. pages 245-253

The question P=?NP is the focal point of much research in theoretical computer science. But is it the right question? We find it biased toward the positive answer. It is conceivable that the negative answer is established without providing much evidence for the difficulty of NP problems in practical terms. We argue in favor of an alternative to P=?NP based on the average-case complexity.},
url = {http://approjects.co.za/?big=en-us/research/publication/challenger-solver-game-variations-theme-p-np/},
pages = {223-394},
journal = {Logic in Computer Science Column The Bulletin of EATCS},
volume = {40},
}