| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4637330 | Applied Mathematics and Computation | 2006 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Wenxing Zhu,