Computing the Value of a Boolean Expression with Interval Inputs is NP-Hard

Reliable Computing

Volumn 3, Issue 2, 1997, Pages 155-172

  Chee, Leticia S ^a,b  

^a University of Texas at El Paso   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2342468773     PISSN: 13853139     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009937906231     Document Type: Article

References (11)

1. Gaganov, A. A.: Computational Complexity of the Range of the Polynomial in Several Variables, Leningrad University, Math. Department, M.S. Thesis, 1981 (in Russian).
2. Gaganov, A. A.: Computational Complexity of the Range of the Polynomial in Several Variables, Cybernetics (1985), pp. 418-421.
3. Garey, M. R. and Johnson, D. S.: Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
4. Gries, D. and Schneider, F. B.: A Logical Approach to Discrete Math, Springer-Verlag, N.Y., 1993.
5. Klir, G. and Yuan, B.: Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice Hall, Upper Saddle River, NJ, 1995.
6. Kreinovich, V.: Remarks on the Margins of Kushner's Book: On the Constructive Mathematical Analysis Restricted to Polynomial Time Algorithms, Manuscript, Leningrad, 1973 (in Russian).
7. Kreinovich, V., Reviewer's remarks in a review of Bridges, D. S.: Constrictive Functional Analysis, Pitman, London, 1979; Zentralblatt für Mathematik 401 (1979), pp. 22-24.
8. Kreinovich, V., Reviewer's remarks in a review of Bridges, D. S.: Constrictive Functional Analysis, Pitman, London, 1979; Zentralblatt für Mathematik 401 (1979), pp. 22-24.
9. Kreinovich, V., Lakeyev, A., and Rohn, J.: Computational Complexity of Interval Algebraic Problems; Some Are Feasible and Some Are Computationally Intractable; A Survey, in: Alefeld, G., Frommer, A., and Lang, B. (eds), Scientific Computing and Validated Numerics, Akademie-Verlag, Berlin, 1996, pp. 293-306.
10. Kreinovicli, V., Lakeyev, A., Rohn, J., and Kahl, P.: Feasible? Intractable? On Computational Complexity of Data Processing and Interval Computations, Kluwer Academic Press, 1997 (to appear).
11. Zadeh, L. A.: Fuzzy Sets, Inform. and Control 8 (1965), pp. 338-353.