1. Michael Sipser. Introduction to the theory of computation: second edition. PWS Pub., Boston, 2 edition, 2006.
   Note: 96035322 Michael Sipser. Includes bibliographical references (p. - ) and index. Pt. 1. Automata and Languages. 1. Regular Languages. 2. Context-Free Languages -- Pt. 2. Computability Theory. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory -- Pt. 3. Complexity Theory. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced topics in complexity theory.
   Keywords: computational complexity, honours reading. [bibtex-entry]



2. Kenneth H. Rosen. Discrete mathematics and its applications. McGraw-Hill, Boston, 5th edition, 2003.
   Note: 2002070890 Kenneth H. Rosen. Includes bibliographic references (p. 1-8, 4th set) and indexes.
   Keywords: theory of computation, computational complexity, honours reading. [bibtex-entry]



3. John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, Boston, 2nd edition, 2001.
   Note: 00064608 John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman. Includes bibliographical references (p. 510-511) and index.
   Keywords: theory of computation, computational complexity, honours reading. [bibtex-entry]



4. Kenneth H. Rosen and John G. Michaels. Handbook of discrete and combinatorial mathematics. CRC Press, Boca Raton, FL, 2000.
   Note: 99048378 99048378 Kenneth H. Rosen, editor in chief, John G. Michaels, project editor ... [et al.]. Includes bibliographical references and index.
   Keywords: computational complexity, discrete mathematics, honours reading. [bibtex-entry]



5. Rod Downey and Michael R. Fellows. Parameterized complexity, Monographs in computer science.. Springer, New York, 1999.
   Note: R.G. Downey, M.R. Fellows. New Zealand authors. Includes bibliographical references (p. [489]-516) and index.
   Keywords: computational complexity, graph theory, honours reading. [bibtex-entry]



6. Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, New York, 1997.
   Note: 96012840 96012840 Eyal Kushilevitz, Noam Nisan. Includes bibliographical references (p. 176-185) and index. 1. Basics -- 2. More on Covers -- 3. Randomization -- 4. Advanced Topics -- 5. The Communication Complexity of Relations -- 6. Multiparty Communication Complexity -- 7. Variable Partition Models -- 8. Networks, Communication, and VLSI -- 9. Decision Trees and Data Structures -- 10. Boolean Circuit Depth -- 11. More Boolean Circuit Lower Bounds -- 12. Time and Space -- 13. Randomness -- 14. Further Topics -- Index of Notation -- A. Mathematical Background.
   Keywords: Computational complexity, computational complexity, honours reading. [abstract] [bibtex-entry]



7. Michael Sipser. Introduction to the theory of computation. PWS Pub., Boston, 1997.
   Note: 96035322 Michael Sipser. Includes bibliographical references (p. - ) and index. Pt. 1. Automata and Languages. 1. Regular Languages. 2. Context-Free Languages -- Pt. 2. Computability Theory. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory -- Pt. 3. Complexity Theory. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced topics in complexity theory.
   Keywords: computational complexity, honours reading. [bibtex-entry]



8. Nancy Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
   Keywords: algorithmic complexity, computational complexity, algorithms, honours reading. [bibtex-entry]



9. Alan Gibbons. Algorithmic graph theory. Cambridge University Press, Cambridge ; New York, 1985.
   Note: Alan Gibbons. Includes bibliographies and indexes.
   Keywords: graph theory, theory of computation, computational complexity, honours reading. [bibtex-entry]



10. Michael R. Garey and David S. Johnson. Computers and intractability : a guide to the theory of NP-completeness, A Series of books in the mathematical sciences.. W. H. Freeman, San Francisco, 1979.
    Note: Michael R. Garey, David S. Johnson. Includes indexes. Bibliography: p. [291]-325. NP-completeness.
    Keywords: computational complexity, algorithms, honours reading. [bibtex-entry]



11. John E. Hopcroft and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, Mass., 1979.
    Note: John E. Hopcroft, Jeffrey D. Ullman. ill. ; 24 cm. Includes index.
    Keywords: theory of computation, computational complexity, honours reading. [bibtex-entry]

1. Ramon Bejar, Carmel Domshlak, Cesar Fernandez, Carla Gomes, Bhaskar Krishnamachari, Bart Selman, and Magda Valls. Sensor networks and distributed CSP: communication, computation and complexity. Artificial Intelligence, 161:117--147, 2005.
   Keywords: computational complexity, sensor networks, honours reading. [bibtex-entry]



2. George Gottlob, Phokion G. Kolaitis, and Thomas Schwentick. Existential second-order Logic over graphs: charting the tractability frontier. Journal of the ACM, 51(2):312--362, 2004.
   Keywords: graph theory, honours reading, computational complexity. [bibtex-entry]



3. JAcob Toran. On the hardness of graph isomorphism. SIAM J. Comput, 33(3):1093--1108, 2004.
   Keywords: graph theory, computational complexity, honours reading. [bibtex-entry]



4. J. Dix, H. Munoz-Avila, D. S. Nau, and L. Zhang. IMPACTing SHOP: Putting an AI planner into a multi-agent environment. Annals of Mathematics & Artificial Intelligence, 37(4):381--407, 2003.
   Note: Publisher: Kluwer Academic Publishers, Netherlands.
   Keywords: planning, honours reading, agent programming languages, computational complexity. [abstract] [bibtex-entry]



5. D. V. Pynadath and M. Tambe. The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models. Journal of Artificial Intelligence Research, 16:389--423, 2002.
   Keywords: computational complexity, teamwork, Markov theory, graph theory, agent communication languagess, honours reading. [abstract] [bibtex-entry]



6. Juan A. Garay and Yoram Moses:. Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds.. SIAM J. Comput, 27(1):247--290, 1998.
   Keywords: algorithms, computational complexity, honours reading. [bibtex-entry]



7. Tom Bylander. The Computational Complexity of Propositional STRIPS Planning. Artificial Intelligence, 69(1-2):165--204, 1994.
   Keywords: planning, honours reading, computational complexity. [bibtex-entry]



8. Joseph Y. Halpern and Yoram Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3):319--379, 1992.
   Keywords: computational complexity, model theory, modal logic, honours reading. [abstract] [bibtex-entry]



9. 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]



10. H. J. Levesque and R. J. Brachman. Expressiveness and tractability in knowledge representation and reasoning Computational Intelligence journal. 3:78--93, 1987.
    Keywords: honours reading, computational complexity. [bibtex-entry]



11. H. J. Levesque and R. J. Brachman. Expressiveness and tractability in knowledge representation and reasoning. Computational Intelligence, 3(2):78--93, 1987.
    Note: Canada.
    Keywords: computational complexity, proof theory, honours reading. [abstract] [bibtex-entry]



12. L. Stockmeyer. Planar 3-colorability is polynomial complete.. SIGACT News,, 5(3):19--25, 1973.
    Keywords: graph theory, computational complexity, honours reading. [bibtex-entry]

1. Tim French. Bisimulation Quantified Modal Logics: Decidability. In Advances in Modal Logic, pages 147--166, 2006.
   Keywords: modal logic, model theory, honours reading, computational complexity. [bibtex-entry]



2. Georg Gottlob, Reinhard Pichler, and Fang Wei. Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. In AAAI, pages 613--620, 2006.
   Keywords: graph theory, computational complexity, honours reading. [bibtex-entry]



3. John Davin and Pragnesh Jay Modi. Impact of Problem Centralization in Distributed Constraint Optimization Algorithms. In Autonomous Agent and Multiagent Systems (AAMAS-05), Urtrect, pages 1057--1063, 2005.
   Keywords: multiagent coordination, honours reading, DCOP, DCSP, computational complexity. [bibtex-entry]



4. Tim French. Bisimulation Quantified Logics: Undecidability. In FSTTCS, pages 396--407, 2005.
   Keywords: modal logic, model theory, honours reading, computational complexity. [bibtex-entry]



5. H. Van Dyke Parunak, Sven Brueckner, and Robert Savit. Universality in Multi-Agent Systems. In International Conference on Autonomous Agents and Multi Agent Systems (AAMAS), New York, 2004.
   Keywords: agents, computational complexity, epistemic logic, honours reading. [bibtex-entry]



6. Pragnesh Jay Modi, Shen Wei-Min, and Milind Tambe. An Asynchronous Complete method for distributed constraint optimization. In Jeffrey S. Rosenschein, Tuomas Sandholm, Michael Wooldridge, and Makoto Yokoo, editors, AAMAS-2003, Melbourne, pages 161--176, 2003.
   Keywords: constraint satisfaction, computational complexity, algorithms, DCOP, DCSP. [abstract] [bibtex-entry]



7. J. Y. Halpern and R. A. Shore. Reasoning about common knowledge with infinitely many agents. In Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)., pages 384--93, 1999. IEEE Comput. Soc..
   Note: Los Alamitos, CA, USA. Proceedings. 14th Symposium on Logic in Computer Science. Trento, Italy. IEEE. 2-5 July 1999.
   Keywords: computational complexity, agents, honours reading. [abstract] [bibtex-entry]



8. 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]

1. R. B. Borie, R. Gary Parker, and C. A. Tovey. Solving problems on recursively constructed graphs. Technical Report TR-2002-04, Dept. Comp. Sci., University of Alabama, 2002.
   Keywords: graph theory, algorithms, computational complexity, honours reading. [bibtex-entry]



2. L Babai. Communication complexity. Technical Report TR-2001-09, Department of Computer Science, The University of Chicago, 2001 2001.
   Keywords: computational complexity, honours reading. [bibtex-entry]



3. Bernard Chazelle. The PCP Theorem. Technical Report 2001, Princeton University, 2001.
   Keywords: computational complexity, honours reading. [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.