NP-Completeness of the linear complementarity problem
- 1 March 1989
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 60 (3) , 393-399
- https://doi.org/10.1007/bf00940344
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Computational complexity of complementary pivot methodsPublished by Springer Nature ,1978
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972