COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro - P versus NP problem - Document - PDFSEARCH.IO

First Page	Meta Content
	COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro Add to Reading List Document Date: 2014-01-08 09:09:08 Open Document File Size: 334,26 KB Share Result on Facebook Country United Kingdom / / / Facility University of Bristol Bristol / / IndustryTerm polynomial-time algorithms / / Organization Ashley Montanaro ashley@cs.bris.ac.uk Department of Computer Science / University of Bristol Bristol / / Technology polynomial-time algorithms / / SocialTag Complexity classes Analysis of algorithms Mathematical optimization Time complexity Algorithm P NP-complete P versus NP problem Quantum algorithm Theoretical computer science

COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley MontanaroAdd to Reading List