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

First Page		Document Content
Date: 2012-02-01 04:29:17 Applied mathematics EXPSPACE STRIPS PSPACE NP IP PP EXPTIME FO Theoretical computer science Computational complexity theory Complexity classes		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 Add to Reading List Source URL: www.ida.liu.se Download Document from Source Website File Size: 209,45 KB Share Document on Facebook

	starting point TCP/IP State Transition Diagram (RFC793) CLOSED DocID: 1xVUl - View Document
	Detecting Intentional Packet Drops on the Internet via TCP/IP Side Channels: Extended Version arXiv:1312.5739v1 [cs.NI] 19 Dec 2013 DocID: 1xVzb - View Document
	NTT Global IP Network Configuration Tools Overview! Presented by: Shawn Morris DocID: 1xVen - View Document
	Choudhury et al. VOL. 10, NO. 10/OCTOBER 2018/J. OPT. COMMUN. NETW. 1 Two Use Cases of Machine Learning for SDN-Enabled IP/Optical Networks: DocID: 1xUSk - View Document
	Schweizerischer Verband der Telekommunikation \| Association Suisse des Télécommunications \| Swiss Telecommunications Association Medienmitteilung Umstellung auf digitale IP-Telefonie – Neuer Leitfaden unterstützt A DocID: 1xTzw - View Document