Strongly NP-complete - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2009-08-01 00:43:08 Applied mathematics NP-complete Optimality theory NP-hard NP Hamiltonian path problem Complete Strongly NP-complete Co-NP Theoretical computer science Computational complexity theory Complexity classes		Add to Reading List Source URL: ling.umd.edu Download Document from Source Website File Size: 76,11 KB Share Document on Facebook

	Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-co DocID: 1xTKi - View Document
	PDF Document DocID: 1xPF6 - View Document
	PDF Document DocID: 1xJXq - View Document
	PDF Document DocID: 1xBTD - View Document
	PDF Document DocID: 1xjW6 - View Document