Book review: Descriptive complexity, by Neil ImmermanKlonowski · Hindawi Publishing Corporation2001PDF2.3 MB
Neil Immerman. Upper and Lower Bounds for First Order Expressibility. Journal of Computer and System Sciences, Vol. 25 (1982), Pp. 76–98. - Neil Immerman. Relational Queries Computable in Polynomial Time. Information and Control, Vol. 68 (1986), Pp. 86–104. - Neil Immerman. Languages That Capture Complexity Classes. SIAM Journal on Computing, Vol. 16 (1987), Pp. 760–778.Buss · Association for Symbolic Logic1989PDF328 KB
Descriptive complexity: By Neil Immerman. Springer-Verlag, New York. (1999). 268 pages. $54.95, DM 99.00, öS 723.00, sFr 90.50, GBP 38.00Computers & Mathematics with Applications1999PDF99 KB
