搜索结果: 1-1 共查到“统计判决理论 Complexity”相关记录1条 . 查询时间(0.073 秒)
Completing Aronov et al.’s study on zero-discrepancymatrices for digital halftoning, we determine all (m, n, k, l) for which it is possible to put mn consecutive integers on an m × n board (with wrap-...