Automated planning and scheduling - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2003-05-27 08:56:44 Applied mathematics EXPSPACE 2-EXPTIME NP Automated planning and scheduling EXPTIME Non-deterministic Turing machine DSPACE Alternating Turing machine Theoretical computer science Computational complexity theory Complexity classes		Add to Reading List Source URL: www.informatik.uni-freiburg.de Download Document from Source Website File Size: 92,53 KB Share Document on Facebook

	Lecture 5: Introduction to Complexity TheoryComplexity Theory DocID: 1b02D - View Document
	Parameterized Regular Expressions and Their Languages Pablo Barceló1 , Leonid Libkin2 , and Juan L. Reutter2 1 2 DocID: 151Cb - View Document
	Parameterized Regular Expressions and Their Languages Pablo Barcel´oa , Juan Reutterb , Leonid Libkinb a Department of Computer Science, University of Chile b DocID: 12Rvf - View Document
	Some Results on the Complexity of Planning with Incomplete Information Patrik Haslum and Peter Jonsson Department of Computer and Information Science Linkoping University, S[removed]Linkoping, Sweden fpahas,petejg@ida.l DocID: O7X5 - View Document
	PDF Document DocID: 1isl - View Document