|Home Latest Advanced Search By Year By Division|
|Not Logged in. Login|
The complexity of the minimum k-cover problem
Cole, Richard and Iliopoulos, Costas S. and Mohamed, Manal and Smyth , W. F. and Yang, Lu (2005) The complexity of the minimum k-cover problem. Journal of Automata, Languages & Combinatorics, 10 (5). pp. 641-653. (In Press)
Full text not available from this repository.
Repository Staff Only: item control page