Logical omniscience as a computational complexity problem

Artemov, Sergei; Kuznets, Roman (2009). Logical omniscience as a computational complexity problem. In: Heifetz, Aviad (ed.) TARK '09. Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (p. 14). New York: Association for Computing Machinery ACM 10.1145/1562814.1562821

Full text not available from this repository. (Request a copy)

Item Type: Conference or Workshop Item (Paper)
Division/Institute: 08 Faculty of Science > Institute of Computer Science (INF) > Logic and Theory Group (LTG)
08 Faculty of Science > Institute of Computer Science (INF)
UniBE Contributor: Kuznets, Roman
Publisher: Association for Computing Machinery ACM
Language: English
Submitter: Factscience Import
Date Deposited: 04 Oct 2013 15:23
Last Modified: 26 Jun 2016 01:44
Publisher DOI: 10.1145/1562814.1562821
URI: http://boris.unibe.ch/id/eprint/37193 (FactScience: 207168)

Actions (login required)

Edit item Edit item
Provide Feedback