![Complexity classes / Analysis of algorithms / Mathematical optimization / Time complexity / Algorithm / P / NP-complete / P versus NP problem / Quantum algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics Complexity classes / Analysis of algorithms / Mathematical optimization / Time complexity / Algorithm / P / NP-complete / P versus NP problem / Quantum algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/a36b6010d27bcfcde20fa31408b2cd1b.jpg)
| Document Date: 2014-01-08 09:09:08 Open Document File Size: 334,26 KBShare 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 |