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 |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |