Computational Complexity, NP Completeness and Optimization Duality: A Survey.
Year: 2012
Type: preprint
Authors: Prabhu Manyem, Julien Ugon
Institution: Federation University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W2399992960
