First Page | Document Content | |
---|---|---|
Date: 2018-05-21 09:45:07Complexity classes Mathematics Theoretical computer science Discrete mathematics EXPTIME P Reachability problem Matrix Controllability Decidability Reachability Word problem | Reachability games and related matrix and word problems Thesis submitted in accordance with the requirements of the University of Liverpool for the degree of Doctor in Philosophy byAdd to Reading ListSource URL: cgi.csc.liv.ac.ukDownload Document from Source WebsiteFile Size: 4,10 MBShare Document on Facebook |
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 |