First Page | Document Content | |
---|---|---|
![]() Date: 2014-10-16 13:22:26Applied mathematics P EXPTIME EXPSPACE L FO 2-EXPTIME Theoretical computer science Computational complexity theory Complexity classes | Add to Reading List |
![]() | Introduction & Motivation Relations and Operations Boolean and 3-element casesDocID: 1qCnb - View Document |
![]() | An ExpTime Tableau Method for Dealing with Nominals and Quantified Number Restrictions in Deciding the Description Logic SHOQ Linh Anh Nguyen1,2 and Joanna Goli´ nska-Pilarek3 1DocID: 1mxoK - View Document |
![]() | PDF DocumentDocID: 1iFYu - View Document |
![]() | Deciding k CFA is complete for EXPTIME ∗ David Van Horn Harry G. Mairson Brandeis UniversityDocID: 1eiBE - View Document |
![]() | Lecture 5: Introduction to Complexity TheoryComplexity TheoryDocID: 1b02D - View Document |