New graph characteristic and its application to numerical computability

Information Processing Letters

Volumn 77, Issue 5-6, 2001, Pages 277-282

  Harary, Frank ^a   Kreinovich, Vladik ^b   Longpré, Luc ^b  

^a NEW MEXICO STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT EL PASO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; NUMBER THEORY; THEOREM PROVING;

REAL NUMBERS;

GRAPH THEORY;

EID: 0035277901     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00153-8     Document Type: Article

References (8)

1. Beeson M.J. Foundations of Constructive Mathematics. 1985;Springer, New York.
2. Bishop E. Foundations of Constructive Analysis. 1967;McGraw-Hill, New York.
3. Bishop E., Bridges D.S. Constructive Analysis. 1985;Springer, New York.
4. Bridges D.S. Constructive Functional Analysis. 1979;Pitman, London.
5. Gasarch W.I., Martin G.A. Bounded Queries in Recursion Theory. 1998;Birkhäuser, Boston, MA.
6. Harary F. Graph Theory. 1969;Addison-Wesley, Reading, MA.
7. Harary F., Norman R.Z., Cartwright D. An Introduction to the Theory of Directed Graphs. 1965;Wiley, New York.
8. Kreinovich V., Lakeyev A., Rohn J., Kahl P. Computational Complexity and Feasibility of Data Processing and Interval Computations. 1997;Kluwer, Dordrecht.