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 by

First Page		Document Content
Date: 2018-05-21 09:45:07 Complexity 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 by Add to Reading List Source URL: cgi.csc.liv.ac.uk Download Document from Source Website File Size: 4,10 MB Share Document on Facebook

	Introduction & Motivation Relations and Operations Boolean and 3-element cases DocID: 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 1 DocID: 1mxoK - View Document
	PDF Document DocID: 1iFYu - View Document
	Deciding k CFA is complete for EXPTIME ∗ David Van Horn Harry G. Mairson Brandeis University DocID: 1eiBE - View Document
	Lecture 5: Introduction to Complexity TheoryComplexity Theory DocID: 1b02D - View Document