A DETERMINISTIC ALGORITHM FOR MODULAR KNAPSACK-PROBLEMS

被引：4
|
作者：
SALOMAA, A
机构：
[1] Mathematics Department, University of Turku
来源：
THEORETICAL COMPUTER SCIENCE | 1991年 / 88卷 / 01期
关键词：
4;
D O I：
10.1016/0304-3975(91)90077-F
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present an algorithm for finding out whether or not a given vector results from some super-increasing vector by modular multiplication. In the positive case the algorithm produces such a super-increasing vector as well as a multiplier and a modulus. The algorithm is deterministic and is based on elementary considerations only.
引用
收藏
页码：127 / 138
页数：12
相关论文
共 50 条
12345