分类：新浪微博
语言：简体中文
大小：未知
发布时间：08-03-20
35本有关计算理论的书籍，其中不乏Christos Papadimitriou，Michael Sipser这样的大家的著作。ISBN: 9780849326493Publisher：CRC PressSUMMARY:Algorithms and Theory of Computation Handbook is a comprehensive collection of algorithms and data structures that also covers many theoretical issues. It offers a balanced perspective that reflects the needs of practitioners, including emphasis on applications within discussions on theoretical issues. Chapters include information on finite precision issues as well as discussion of specific algorithms where algorithmic techniques are of special importance, including graph drawing, robotics, forming a VLSI chip, vision and image processing, data compression, and cryptography. The book also presents some advanced topics in combinatorial optimization and parallel/distributed computing. - applications areas where algorithms and data structuring techniques are of special importance - graph drawing - robot algorithms - VLSI layout - vision and image processing algorithms - scheduling - electronic cash - data compression - dynamic graph algorithms - on-line algorithms - multidimensional data structures - cryptography - advanced topics in combinatorial optimization and parallel/distributed computing.ISBN: 9780521294652Publisher: Cambridge University Press, 1980.SUMMARY:What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.ISBN: 9780521884730Publisher: Cambridge University Press, 2008.SUMMARY:This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems....
