Handbook of Applied Cryptography, by A. Menezes, P. van Oorschot, and S. Vanstone, CRC Press, 1996
标签： A. P. S. Cryptography
上传时间： 2014-01-22
上传用户：playboys0
·A·S·P·考试系统+论文······
标签： 论文
上传时间： 2017-03-17
上传用户：上善若水
Tool to dump Epson ESC/P print files to readable Text
标签： readable Epson print files
上传时间： 2014-01-11
上传用户：dancnc
运用P-R状态方程，迭代计算甲烷气体压缩因子
上传时间： 2017-03-21
上传用户：cazjing
这是一个vxworks中p关于osix的例子，很好的源码，希望大家有收获
上传时间： 2014-10-27
上传用户：haohaoxuexi
用visual c++ 写的外挂. 劲舞团卡p使用
标签： visual
上传时间： 2017-04-08
上传用户：希酱大魔王
Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the edges in each of the cycle discovered. Input will be the adjacency matrix preceded by a 0 or 1 representing Directed or Undirected graphs respectively.
标签： undirected Disjoint directed Cycles
上传时间： 2017-04-08
上传用户：13188549192
voodshe hren kakayato vsyakuyu huinyu zalivaty(p.s. kto ponimaet po russki-ne kachaite!)
标签： p.s. russki-ne kakayato kachaite
上传时间： 2014-01-01
上传用户：it男一枚
about image p[rocesing
上传时间： 2014-01-25
上传用户：hxy200501
A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put a "rubber band" around all the points, and let it wrap as tight as it can. The resultant polygon is a convex hull.
上传时间： 2013-12-23
上传用户：it男一枚
