Most public key cryptosystems used in practice are based on integer factorization or discrete logarithms (in finite fields or elliptic curves). However, if large enough quantum computers can be built, Shor’s algorithm will render them completely ins
（为.djvu文件，可用WinDjView 打开） COMPUTERS AND INTRACTABILITY： A Guide to the Theory of NP-Completeness by Michael R. Garey & David S. Johnson Content 1 Computers, Complexity, and Intractability 1 1.1 Introduction 1 1.2 Problems, Algorithms, and Complexity
算法导论，英文 【本书目录】 I Foundations Introduction 3 l The Role of Algorithms in Computing 5 l.l Algorithms 5 l.2 Algorithms as a technology 10 2 Getting Started I5 2.l Insertion sort 15 2.2 Analyzing algorithms 21 2.3 Designing algorithms 27 3 Growth of Fun
时滞系统稳定性必备书That every problem in NP can be polynomially reduced to an NP-hard problem suggests a proof for NP-hardness. It follows that if a problem ℘1 is NP-hard and polynomially reducible to some problem ℘2, then ℘2 must also be NP-hard. In other w
全英文，一共529页，国外的一朋友给的，08年的新书，在亚马逊英文站点有相关书评可供参考。现在计算机正在步入多核时代，这部书值得参考。 This book is intended to serve both as a textbook for a senior-level undergraduate course, and as a reference for practitioners. Readers should know enough discrete mathematics to u
The problem of nding the longest common subsequence (lcs) of a given set of se- quences over an alphabet occurs in many interesting contexts, such as data com- pression and molecular biology, in order to measure the \similarity degree" among biolo
Subgraph search is the problem of searching a data graph for the occurrences of another graph, typically referred to as the query or pattern graph. This thesis is dedicated to studying a specific class of subgraph search, named subgraph isomorphism
Few technical terms have gained such rapid notoriety as the appela- tion HNP-complete." In the short time since its introduction in the early 1970's, this term has come to symbolize the abyss of inherent intractability that algorithm designers incre
