On total functions, existence theorems and computational complexity
- 1 April 1991
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 81 (2) , 317-324
- https://doi.org/10.1016/0304-3975(91)90200-l
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An interior point potential reduction algorithm for the linear complementarity problemMathematical Programming, 1992
- Simple Local Search Problems that are Hard to SolveSIAM Journal on Computing, 1991
- Nash and correlated equilibria: Some complexity considerationsGames and Economic Behavior, 1989
- Structure in locally optimal solutionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- How easy is local search?Journal of Computer and System Sciences, 1988
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- Every Prime Has a Succinct CertificateSIAM Journal on Computing, 1975
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965