First Page | Document Content | |
---|---|---|
Date: 2013-10-30 13:41:09Computational complexity theory Complexity classes Theory of computation PPAD Reduction LemkeHowson algorithm Algorithm NP PSPACE-complete P True quantified Boolean formula | The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K.Add to Reading ListSource URL: www.maths.lse.ac.ukDownload Document from Source WebsiteFile Size: 3,77 MBShare Document on Facebook |