The 0—1 Integer Programming Problem in a finite ring with identity |
| |
Authors: | Bart Rice |
| |
Affiliation: | Department of Defense, Washington, D.C., USA |
| |
Abstract: | We define the 0—1 Integer Programming Problem in a finite field or finite ring with identity as: given an m × n matrix A and an n × 1 vector b with entries in the ring R, find or determine the non-existence of a 0—1 vector x such that Ax = b. We give an easily implemented enumerative algorithm for solving this problem, along with conditions that spurious solutions occur with probability as small as desired. Finally, we show that the problem is NP-complete if R is the ring of integers modulo r for r ≥ 3. This result suggests that it will be difficult to improve on our algorithm. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|