Back to Results
First PageMeta Content
Computational 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 List

Document Date: 2013-10-30 13:41:09


Open Document

File Size: 3,77 MB

Share Result on Facebook
UPDATE