Indexed by：
Abstract：
We show that over unbounded domain no algorithm can be created for the integer programming, nonlinear equations, continuous global optimization and constraint satisfaction problems. (c) 2005 Elsevier Inc. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
APPLIED MATHEMATICS AND COMPUTATION
ISSN： 0096-3003
Year： 2006
Issue： 2
Volume： 174
Page： 921-926
0 . 8 1 6
JCR@2006
3 . 5 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
JCR Journal Grade：2
Cited Count：
WoS CC Cited Count： 10
SCOPUS Cited Count： 9
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
