Neil Immerman. Upper and lower bounds for first order expressibility. Journal of computer and system sciences, vol. 25 , pp. 76–98. - Neil Immerman. Relational queries computable in polynomial time. Information and control, vol. 68 , pp. 86–104. - Neil Immerman. Languages that capture complexity classes. SIAM journal on computing, vol. 16 , pp. 760–778 [Book Review]

Journal of Symbolic Logic 54 (1):287-288 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 98,072

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2014-04-08

Downloads
23 (#799,279)

6 months
8 (#469,955)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references