Author： Guruswami V. Khanna S. Rajaraman R. Shepherd B. Yannakakis M.
Publisher： Elsevier
ISSN： 0022-0000
Source： Journal of Computer and System Sciences, Vol.67, Iss.3, 2003-11, pp. : 473-496
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Access to resources
Recommend
Hardness results for neural network approximation problems
Theoretical Computer Science, Vol. 284, Iss. 1, 2002-07 ,pp. :
Hardness results and approximation algorithms of k-tuple domination in graphs
Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. :
Optimal and Near-Optimal Algorithms for
By Santos E.E.
Journal of Parallel and Distributed Computing, Vol. 57, Iss. 2, 1999-05 ,pp. :