1. N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760--78, 1987.
   Note: USA.
   Keywords: computational complexity, honours reading. [abstract] [bibtex-entry]

1. Neil Immerman. Languages Which Capture Complexity Classes. In 15th ACM STOC Symposium, pages 347--354, 1983.
   Keywords: computational complexity, honours reading. [download paper ] [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.