The NP-Completeness of Reflected Fragments of Justification

Buss, Samuel R.; Kuznets, Roman (2009). The NP-Completeness of Reflected Fragments of Justification. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Lecture Notes in Computer Science: Vol. 5407 (pp. 122-136). Heidelberg: Springer Verlag 10.1007/978-3-540-92687-0_9

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

Item Type: Book Section (Book Chapter)
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
Series: Lecture Notes in Computer Science
Publisher: Springer Verlag
Language: English
Submitter: Factscience Import
Date Deposited: 04 Oct 2013 15:23
Last Modified: 08 Sep 2015 16:15
Publisher DOI: 10.1007/978-3-540-92687-0_9
URI: http://boris.unibe.ch/id/eprint/37191 (FactScience: 207166)

Actions (login required)

Edit item Edit item
Provide Feedback