An Algorithm for Determining the Controllers of Supervised Entities at the First and Second Levels: A Case Study with the Brazilian Central Bank
暂无分享,去创建一个
[1] David Chaum,et al. Advances in Cryptology: Proceedings Of Crypto 83 , 2012 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Donald L. Kreher,et al. Solving subset sum problems with the L^3 algorithm , 1988 .
[4] Ernest F. Brickell,et al. Solving Low Density Knapsacks , 1983, CRYPTO.
[5] Jeffrey C. Lagarias,et al. Solving low density subset sum problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[6] David S. L. Wei,et al. Computer Algorithms , 1998, Scalable Comput. Pract. Exp..
[7] Weigang Li,et al. An Algorithm for Determining the Controllers of Supervised Entities at the First Level: Brazilian Central Bank Case Study , 2002, FSKD.