Samuel R. Buss.
    "A review of three papers of Immerman."
    Journal of Symbolic Logic 54 (1989) 287-288.

    Download review: postscript or PDF

    The articles by Niel Immerman are:

   Neil Immerman. "Upper and lower bounds for first order expressibility."
    Journal of Computer and System Sciences 25 (1982) 76-98.

    Neil Immerman. "Relational queries computable in polynomial time."
    Information and Control 68 (1986) 86-104.

    Neil Immerman. "Languages that capture complexity classes."
    SIAM Journal on Computing 16 (1987) 760-778.

Back to Sam Buss's publications page.