Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems
- 10 January 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (5) , 221-226
- https://doi.org/10.1016/0020-0190(90)90188-4
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On γ-reducibility versus polynomial time many-one reducibilityTheoretical Computer Science, 1981
- Combinatorial problems over power setsCalcolo, 1979
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976