{"title":"Mathematical theory of computation","description":"Books on the subject of Mathematical theory of computation","products":[{"product_id":"enumerative-combinatorics-volume-2-paperback-9780521789875","title":"Enumerative Combinatorics: Volume 2 (Paperback) 9780521789875","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eEnumerative Combinatorics: Volume 2\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eAn introduction, suitable for beginning graduate students, showing connections to other areas of mathematics.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eRichard P. Stanley (Author), Sergey Fomin (Appendix by)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521789875, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback, published 4 June 2001\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e600 pages\u003cbr\u003e22.9 x 15.2 x 3.8 cm, 0.88 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'What else can be added to the comments upon this excellent book?' EMS Newsletter\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThis second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the only available treatment of this subject suitable for an introductory graduate course on combinatorics, and includes the important Robinson-Schensted-Knuth algorithm. Also covered are connections between symmetric functions and representation theory. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory, including jeu de taquin and the Littlewood-Richardson rule. As in Volume 1, the exercises play a vital role in developing the material. There are over 250 exercises, all with solutions or references to solutions, many of which concern previously unpublished results. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e5. Composition of generating functions\u003cbr\u003e 6. Algebraic, D-finite, and noncommutative generating functions\u003cbr\u003e 7. Symmetric functions\u003cbr\u003e Appendix Sergey Fomin.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Combinatorics \u0026amp; graph theory [\u003ca title=\"See our other books on Combinatorics \u0026amp; graph theory\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Combinatorics%20\u0026amp;%20graph%20theory%20%5BPBV%5D%22\"\u003ePBV\u003c\/a\u003e], Algebra [\u003ca title=\"See our other books on Algebra\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Algebra%20%5BPBF%5D%22\"\u003ePBF\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46001688805656,"sku":"9780521789875","price":39.67,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521789875i_5ea36535-abb3-4904-b91d-b4d46e1d8e84.jpg?v=1691367950"},{"product_id":"temporal-logics-in-computer-science-finite-state-systems-hardback-9781107028364","title":"Temporal Logics in Computer Science; Finite-State Systems (Hardback) 9781107028364","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eTemporal Logics in Computer Science\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eFinite-State Systems\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cem\u003eA comprehensive, modern and technically precise exposition of the theory and main applications of temporal logics in computer science.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eStéphane Demri (Author), Valentin Goranko (Author), Martin Lange (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781107028364, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 13 October 2016\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e752 pages, 180 b\/w illus.  450 exercises\u003cbr\u003e25.4 x 18 x 4.3 cm, 1.45 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'In summary, the book presents the most important and influential temporal logics, presents their properties, and introduces the most important tools to reason about temporal logics. It strikes a good balance between breadth and depth in coverage …' Martin Zimmermann, MathSciNet\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThis comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most important temporal logics for transition systems and Part III looks at their expressiveness and complexity. Finally, Part IV describes the main computational methods and decision procedures for model checking and model building - based on tableaux, automata and games - and discusses their relationships. The book contains a wealth of examples and exercises, as well as an extensive annotated bibliography. Thus, the book is not only a solid professional reference for researchers in the field but also a comprehensive graduate textbook that can be used for self-study as well as for teaching courses.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e1. Introduction\u003cbr\u003e Part I. Models: 2. Preliminaries and background I\u003cbr\u003e 3. Transition systems\u003cbr\u003e Part II. Logics: 4. Preliminaries and background II\u003cbr\u003e 5. Basic modal logics\u003cbr\u003e 6. Linear-time temporal logics\u003cbr\u003e 7. Branching-time temporal logics\u003cbr\u003e 8. The modal mu-calculus\u003cbr\u003e 9. Alternating-time temporal logics\u003cbr\u003e Part III. Properties: 10. Expressiveness\u003cbr\u003e 11. Computational complexity\u003cbr\u003e Part IV. Methods: 12. Frameworks for decision procedures\u003cbr\u003e 13. Tableaux-based decision methods\u003cbr\u003e 14. The automata-based approach\u003cbr\u003e 15. The game-theoretic framework\u003cbr\u003e References\u003cbr\u003e Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Computer science [\u003ca title=\"See our other books on Computer science\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Computer%20science%20%5BUY%5D%22\"\u003eUY\u003c\/a\u003e], Programming \u0026amp; scripting languages: general [\u003ca title=\"See our other books on Programming \u0026amp; scripting languages: general\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Programming%20\u0026amp;%20scripting%20languages:%20general%20%5BUMX%5D%22\"\u003eUMX\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46003782517016,"sku":"9781107028364","price":81.99,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9781107028364i_18976553-60e2-468f-b8b2-d0ec9341dfb3.jpg?v=1691361324"},{"product_id":"enumerative-combinatorics-volume-2-hardback-9780521560696","title":"Enumerative Combinatorics: Volume 2 (Hardback) 9780521560696","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eEnumerative Combinatorics: Volume 2\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eAn introduction, suitable for beginning graduate students, showing connections to other areas of mathematics.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eRichard P. Stanley (Author), Sergey Fomin (Appendix by)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521560696, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 13 January 1999\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e600 pages\u003cbr\u003e23.7 x 16 x 3.8 cm, 1.045 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'What else can be added to the comments upon this excellent book?' EMS Newsletter\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThis second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the only available treatment of this subject suitable for an introductory graduate course on combinatorics, and includes the important Robinson-Schensted-Knuth algorithm. Also covered are connections between symmetric functions and representation theory. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory, including jeu de taquin and the Littlewood-Richardson rule. As in Volume 1, the exercises play a vital role in developing the material. There are over 250 exercises, all with solutions or references to solutions, many of which concern previously unpublished results. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e5. Composition of generating functions\u003cbr\u003e 6. Algebraic, D-finite, and noncommutative generating functions\u003cbr\u003e 7. Symmetric functions\u003cbr\u003e Appendix Sergey Fomin.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Combinatorics \u0026amp; graph theory [\u003ca title=\"See our other books on Combinatorics \u0026amp; graph theory\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Combinatorics%20\u0026amp;%20graph%20theory%20%5BPBV%5D%22\"\u003ePBV\u003c\/a\u003e], Algebra [\u003ca title=\"See our other books on Algebra\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Algebra%20%5BPBF%5D%22\"\u003ePBF\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46005106213144,"sku":"9780521560696","price":306.97,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521560696i_eaa0cf0a-697a-461c-91db-28cb113ebc4e.jpg?v=1691369792"},{"product_id":"tractability-practical-approaches-to-hard-problems-hardback-9781107025196","title":"Tractability; Practical Approaches to Hard Problems (Hardback) 9781107025196","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eTractability\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003ePractical Approaches to Hard Problems\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cem\u003eAn overview of the techniques developed to circumvent computational intractability, a key challenge in many areas of computer science.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eLucas Bordeaux (Edited by), Youssef Hamadi (Edited by), Pushmeet Kohli (Edited by)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781107025196, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 6 February 2014\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e396 pages, 75 b\/w illus.\u003cbr\u003e25.3 x 17.8 x 2 cm, 0.93 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eClassical computer science textbooks tell us that some problems are 'hard'. Yet many areas, from machine learning and computer vision to theorem proving and software verification, have defined their own set of tools for effectively solving complex problems. Tractability provides an overview of these different techniques, and of the fundamental concepts and properties used to tame intractability. This book will help you understand what to do when facing a hard computational problem. Can the problem be modelled by convex, or submodular functions? Will the instances arising in practice be of low treewidth, or exhibit another specific graph structure that makes them easy? Is it acceptable to use scalable, but approximate algorithms? A wide range of approaches is presented through self-contained chapters written by authoritative researchers on each topic. As a reference on a core problem in computer science, this book will appeal to theoreticians and practitioners alike.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eContributors\u003cbr\u003e Introduction Lucas Bordeaux, Youssef Hamadi and Pushmeet Kohli\u003cbr\u003e Part I. Graphical Structure: 1. Treewidth and hypertree width Georg Gottlob, Gianluigi Greco and Francesco Scarcello\u003cbr\u003e 2. Perfect graphs and graphical modeling Tony Jebara\u003cbr\u003e Part II. Language Restrictions: 3. Submodular function maximization Andreas Krause and Daniel Golovin\u003cbr\u003e 4. Tractable valued constraints Peter G. Jeavons and Stanislav Živný\u003cbr\u003e 5. Tractable knowledge representation formalisms Adnan Darwiche\u003cbr\u003e Part III. Algorithms and their Analysis: 6. Tree-reweighted message passing Vladimir Kolmogorov\u003cbr\u003e 7. Tractable optimization in machine learning Suvrit Sra\u003cbr\u003e 8. Approximation algorithms Mohit Singh and Kunal Talwar\u003cbr\u003e 9. Kernelization methods for fixed-parameter tractability Fedor V. Fomin and Saket Saurabh\u003cbr\u003e Part IV. Tractability in Some Specific Areas: 10. Efficient submodular function minimization for computer vision Pushmeet Kohli\u003cbr\u003e 11. Towards practical graph-based, iteratively decoded channel codes: insights through absorbing sets Lara Dolecek\u003cbr\u003e Part V. Heuristics: 12. SAT solvers Joao Marques-Silva and Ines Lynce\u003cbr\u003e 13. Tractability and modern satisfiability modulo theories solvers Nikolaj Bjørner and Leonardo de Moura.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Artificial intelligence [\u003ca title=\"See our other books on Artificial intelligence\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Artificial%20intelligence%20%5BUYQ%5D%22\"\u003eUYQ\u003c\/a\u003e], Maths for computer scientists [\u003ca title=\"See our other books on Maths for computer scientists\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Maths%20for%20computer%20scientists%20%5BUYAM%5D%22\"\u003eUYAM\u003c\/a\u003e], Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Programming \u0026amp; scripting languages: general [\u003ca title=\"See our other books on Programming \u0026amp; scripting languages: general\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Programming%20\u0026amp;%20scripting%20languages:%20general%20%5BUMX%5D%22\"\u003eUMX\u003c\/a\u003e], Algorithms \u0026amp; data structures [\u003ca title=\"See our other books on Algorithms \u0026amp; data structures\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Algorithms%20\u0026amp;%20data%20structures%20%5BUMB%5D%22\"\u003eUMB\u003c\/a\u003e], Optimization [\u003ca title=\"See our other books on Optimization\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Optimization%20%5BPBU%5D%22\"\u003ePBU\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46265506529560,"sku":"9781107025196","price":94.98,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9781107025196i.jpg?v=1692023588"},{"product_id":"continued-fractions-with-applications-hardback-9780444892652","title":"Continued Fractions with Applications (Hardback) 9780444892652","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eContinued Fractions with Applications\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cfont size=\"4\"\u003eL. Lorentzen (Author), H. Waadeland (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780444892652, Elsevier Science\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 24 April 1992\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e616 pages\u003cbr\u003e23.4 x 15.6 x 3.4 cm, 1.04 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003eA. Bultheel\u003cbr\u003e\"...ample material to make the reader fall in love with continued fractions... If you are interested in learning about continued fractions, this book should be on the top of your reading list.\" \u003cb\u003e--Newsletter on Computational and Applied Mathematics\u003c\/b\u003e\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThis book is aimed at two kinds of readers: firstly, people working in or near mathematics, who are curious about continued fractions; and secondly, senior or graduate students who would like an extensive introduction to the analytic theory of continued fractions. The book contains several recent results and new angles of approach and thus should be of interest to researchers throughout the field. The first five chapters contain an introduction to the basic theory, while the last seven chapters present a variety of applications. Finally, an appendix presents a large number of special continued fraction expansions. This very readable book also contains many valuable examples and problems.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eI. Introductory Examples. II. More Basics. III. Convergence Criteria. IV. Continued Fractions and Three-Term Recurrence Relations. V. Correspondence of Continued Fractions. VI. Hypergeometric Functions. VII. Moments and Orthogonality. VIII. Pad\u0026amp;eacute\u003cbr\u003e Approximants. IX. Some Applications in Number Theory. X. Zero-free Regions. XI. Digital Filters and Continued Fractions. XII. Applications to Some Differential Equations. Appendix: Some Continued Fraction Expansions. References. Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Optimization [\u003ca title=\"See our other books on Optimization\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Optimization%20%5BPBU%5D%22\"\u003ePBU\u003c\/a\u003e], Real analysis, real variables [\u003ca title=\"See our other books on Real analysis, real variables\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Real%20analysis,%20real%20variables%20%5BPBKB%5D%22\"\u003ePBKB\u003c\/a\u003e], Number theory [\u003ca title=\"See our other books on Number theory\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Number%20theory%20%5BPBH%5D%22\"\u003ePBH\u003c\/a\u003e], Algebra [\u003ca title=\"See our other books on Algebra\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Algebra%20%5BPBF%5D%22\"\u003ePBF\u003c\/a\u003e], Mathematical logic [\u003ca title=\"See our other books on Mathematical logic\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20logic%20%5BPBCD%5D%22\"\u003ePBCD\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"North Holland","offers":[{"title":"Default Title","offer_id":46648551342360,"sku":"9780444892652","price":45.99,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780444892652_e98b1abe-234f-4575-819a-82ae0ccf07c7.jpg?v=1694987453"},{"product_id":"algorithmic-graph-theory-and-perfect-graphs-hardback-9780444515308","title":"Algorithmic Graph Theory and Perfect Graphs (Hardback) 9780444515308","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eAlgorithmic Graph Theory and Perfect Graphs\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eCovers many applications associated with classes of perfect graphs\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eMartin Charles Golumbic (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780444515308, Elsevier Science\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 4 February 2004\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e340 pages\u003cbr\u003e24 x 16.5 x 2.4 cm, 0.66 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e\"... this volume is, as was its predecessor, an excellent and motivating introduction to the world of perfect graphs\" \u003cb\u003e--D. de Werra (CH-LSNP; Lausanne) in: Mathematical Reviews\u003c\/b\u003e\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cp\u003e\u003ci\u003eAlgorithmic Graph Theory and Perfect Graphs,\u003c\/i\u003e first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails.\u003c\/p\u003e  \u003cp\u003eThe past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition. \u003c\/p\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Combinatorics \u0026amp; graph theory [\u003ca title=\"See our other books on Combinatorics \u0026amp; graph theory\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Combinatorics%20\u0026amp;%20graph%20theory%20%5BPBV%5D%22\"\u003ePBV\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"North Holland","offers":[{"title":"Default Title","offer_id":46648706498840,"sku":"9780444515308","price":43.96,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780444515308.jpg?v=1694979990"},{"product_id":"handbook-of-automated-reasoning-hardback-9780444508126","title":"Handbook of Automated Reasoning (Hardback) 9780444508126","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eHandbook of Automated Reasoning\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cfont size=\"4\"\u003eAlan J.A. Robinson (Edited by), Andrei Voronkov (Edited by)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780444508126, Elsevier Science\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 21 June 2001\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e1188 pages\u003cbr\u003e24 x 16.5 x 5.4 cm, 2.43 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePart V. Higher-order logic and logical frameworks. \u003cbr\u003e\u003cbr\u003eChapter 15. Classical Type Theory (Peter B. Andrews). \u003cbr\u003e\u003cbr\u003e1. Introduction to type theory.  \u003cbr\u003e2. Metatheoretical foundations.  \u003cbr\u003e3. Proof search.  \u003cbr\u003e4. Conclusion.  \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003eChapter 16. Higher-Order Unification and Matching (Gilles Dowek). \u003cbr\u003e\u003cbr\u003e1. Type Theory and Other Set Theories.  \u003cbr\u003e2. Simply Typed \u0026amp;lgr;-calculus.  \u003cbr\u003e3. Undecidability.  \u003cbr\u003e4. Huet's Algorithm.  \u003cbr\u003e5. Scopes Management.  \u003cbr\u003e6. Decidable Subcases.  \u003cbr\u003e7. Unification in \u0026amp;lgr;-calculus with Dependent Types.  \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003eChapter 17. Logical Frameworks (Frank Pfenning). \u003cbr\u003e\u003cbr\u003e1. Introduction.  \u003cbr\u003e2. Abstract syntax.  \u003cbr\u003e3. Judgments and deductions.  \u003cbr\u003e4. Meta-programming and proof search.  \u003cbr\u003e5. Representing meta-theory.  \u003cbr\u003e6. Appendix: the simply-typed \u0026amp;lgr;-calculus.  \u003cbr\u003e7. Appendix: the dependently typed \u0026amp;lgr;-calculus.  \u003cbr\u003e8. Conclusion.  \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003eChapter 18. Proof-Assistants Using Dependent Type Systems (Henk Barendregt, Herman Geuvers). \u003cbr\u003e\u003cbr\u003e1. Proof checking.  \u003cbr\u003e2. Type-theoretic notions for proof checking.  \u003cbr\u003e3. Type systems for proof checking.  \u003cbr\u003e4. Proof-development in type systems.  \u003cbr\u003e5. Proof assistants.  \u003cbr\u003eBibliography. Index. Name index.  \u003cbr\u003e\u003cbr\u003ePart VI. Nonclassical logics. \u003cbr\u003e\u003cbr\u003eChapter 19. Nonmonotonic Reasoning: Towards Efficient Calculi\u003cbr\u003eand Implementations (Jurgen Dix, Ulrich Furbach, Ilkka Niemela). \u003cbr\u003e\u003cbr\u003e1. General Nonmonotonic Logics.  \u003cbr\u003e2. Automating General Nonmonotonic Logics. \u003cbr\u003e3. From Automated Reasoning to Disjunctive Logic Programming.  \u003cbr\u003e4. Nonmonotonic Semantics of Logic Programs.  \u003cbr\u003e5. Implementing Nonmonotonic Semantics.  \u003cbr\u003e6. Benchmarks.  \u003cbr\u003e7. Conclusion.  \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003eChapter 20. Automated Deduction for Many-Valued Logics \u003cbr\u003e(Matthias Baaz, Christian G. Fermuller, Gernot Salzer). \u003cbr\u003e\u003cbr\u003e1. Introduction.  \u003cbr\u003e2. What is a many-valued logic?  \u003cbr\u003e3. Classification of proof systems for many-valued logics.  \u003cbr\u003e4. Signed logic: reasoning classically about finitely-valued logics.  \u003cbr\u003e5. Signed resolution.  \u003cbr\u003e6. An example.  \u003cbr\u003e7. Optimization of transformation rules.  \u003cbr\u003e8. Remarks on infinitely-valued logics.  \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003eChapter 21. Encoding Two-Valued Nonclassical Logics in Classical Logic (Hans Jurgen Ohlbach, Andreas Nonnengart, Maarten de Rijke, Dov M. Gabbay). \u003cbr\u003e\u003cbr\u003e1. Introduction.  \u003cbr\u003e2. Background.  \u003cbr\u003e3. Encoding consequence relations.  \u003cbr\u003e4. The standard relational translation.  \u003cbr\u003e5. The functional translation.  \u003cbr\u003e6. The semi-functional translation.  \u003cbr\u003e7. Variations and alternatives.  \u003cbr\u003e8. Conclusion.  \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003eChapter 22. Connections in Nonclassical Logics (Arild Waaler). \u003cbr\u003e\u003cbr\u003e1. Introduction.  \u003cbr\u003e2. Prelude: Connections in classical first-order logic.  \u003cbr\u003e3. Labelled systems.  \u003cbr\u003e4. Propositional intuitionistic logic.  \u003cbr\u003e5. First--order intuitionistic logic.  \u003cbr\u003e6. Normal modal logics up to S4.  \u003cbr\u003e7. The S5 family.  \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003ePart VII. Decidable classes and model building. \u003cbr\u003e\u003cbr\u003eChapter 23. Reasoning in Expressive Description Logics (Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Daniele Nardi). \u003cbr\u003e\u003cbr\u003e1. Introduction.  \u003cbr\u003e2. Description Logics.  \u003cbr\u003e3. Description Logics and Propositional Dynamic Logics.  \u003cbr\u003e4. Unrestricted Model Reasoning.  \u003cbr\u003e5. Finite Model Reasoning.  \u003cbr\u003e6. Beyond Basic Description Logics.  \u003cbr\u003e7. Conclusions.  \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003eChapter 24. Model Checking (Edmund M. Clarke, Bernd-Holger Schlingloff). \u003cbr\u003e\u003cbr\u003e1. Introduction.  \u003cbr\u003e2. Logical Languages, Expressiveness.  \u003cbr\u003e3. Second Order Languages.  \u003cbr\u003e4. Model Transformations and Properties.  \u003cbr\u003e5. Equivalence reductions.  \u003cbr\u003e6. Completeness.  \u003cbr\u003e7. Decision Procedures.  \u003cbr\u003e8. Basic Model Checking Algorithms.  \u003cbr\u003e9. Modelling of Reactive Systems.  \u003cbr\u003e10. Symbolic Model Checking. \u003cbr\u003e11. Partial Order Techniques.  \u003cbr\u003e12. Bounded Model Checking.  \u003cbr\u003e13. Abstractions.  \u003cbr\u003e14. Compositionality and Modular Verification.  \u003cbr\u003e15. Further Topics.  \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003eChapter 25. Resolution Decision Procedures (Christian G. Fermuller, Alexander Leitsch, Ullrich Hustadt, Tanel Tammet). \u003cbr\u003e\u003cbr\u003e1. Introduction.  \u003cbr\u003e2. Notation and definitions.  \u003cbr\u003e3. Decision procedures based on ordering refinements.  \u003cbr\u003e4. Hyperresolution as decision procedure.  \u003cbr\u003e5. Resolution decision procedures for description logics.  \u003cbr\u003e6. Related work. \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003ePart VIII. Implementation. \u003cbr\u003eChapter 26. Term Indexing  (R. Sekar, I.V. Ramakrishnan, Andrei Voronkov). \u003cbr\u003e\u003cbr\u003e1. Introduction.  \u003cbr\u003e2. Background.  \u003cbr\u003e3. Data structures for representing terms and indexes.  \u003cbr\u003e4. A common framework for indexing.  \u003cbr\u003e5. Path indexing.  \u003cbr\u003e6. Discrimination trees.  \u003cbr\u003e7. Adaptive automata.  \u003cbr\u003e8. Automata-driven indexing.  \u003cbr\u003e9. Code trees.  \u003cbr\u003e10. Substitution trees.  \u003cbr\u003e11. Context trees.  \u003cbr\u003e12. Unification factoring.  \u003cbr\u003e13. Multiterm indexing.  \u003cbr\u003e14. Issues in perfect filtering.  \u003cbr\u003e15. Indexing modulo AC-theories.  \u003cbr\u003e16. Elements of term indexing.  \u003cbr\u003e17. Indexing in practice.  \u003cbr\u003e18. Conclusion.  \u003cbr\u003eBibliography. Index.  \u003cbr\u003e\u003cbr\u003eChapter 27. Combining Superposition, Sorts and Splitting (Christoph Weidenbach). \u003cbr\u003e\u003cbr\u003e1. What This Chapter is (not) About.  \u003cbr\u003e2. Foundations.  \u003cbr\u003e3. A First Simple Prover.  \u003cbr\u003e4. Inference and Reduction Rules.  \u003cbr\u003e5. Global Design Decisions.  \u003cbr\u003eBibliography. A Links to Saturation Based Provers. Index.  \u003cbr\u003e\u003cbr\u003eChapter 28. Model Elimination and Connection Tableau Procedures  \u003cbr\u003e(Reinhold Letz, Gernot Stenz).\u003cbr\u003e\u003cbr\u003e1. Introduction.  \u003cbr\u003e2. Clausal Tableaux and Connectedness.  \u003cbr\u003e3. Further Structural Refinements of Clausal Tableaux.  \u003cbr\u003e4. Global Pruning Methods in Model Elimination.  \u003cbr\u003e5. Shortening of Proofs.  \u003cbr\u003e6. Completeness of Connection Tableaux.  \u003cbr\u003e7. Architectures of Model Elimination Implementations.  \u003cbr\u003e8. Implementation of Refinements by Constraints.  \u003cbr\u003e9. Experimental Results.  \u003cbr\u003e10. Outlook.  \u003cbr\u003eBibliography. Index. Concept index.  \u003cbr\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Expert systems \/ knowledge-based systems [\u003ca title=\"See our other books on Expert systems \/ knowledge-based systems\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Expert%20systems%20\/%20knowledge-based%20systems%20%5BUYQE%5D%22\"\u003eUYQE\u003c\/a\u003e], Artificial intelligence [\u003ca title=\"See our other books on Artificial intelligence\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Artificial%20intelligence%20%5BUYQ%5D%22\"\u003eUYQ\u003c\/a\u003e], Computer architecture \u0026amp; logic design [\u003ca title=\"See our other books on Computer architecture \u0026amp; logic design\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Computer%20architecture%20\u0026amp;%20logic%20design%20%5BUYF%5D%22\"\u003eUYF\u003c\/a\u003e], Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Mathematical logic [\u003ca title=\"See our other books on Mathematical logic\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20logic%20%5BPBCD%5D%22\"\u003ePBCD\u003c\/a\u003e], Mathematical foundations [\u003ca title=\"See our other books on Mathematical foundations\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20foundations%20%5BPBC%5D%22\"\u003ePBC\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"North Holland","offers":[{"title":"Default Title","offer_id":46648836817176,"sku":"9780444508126","price":131.89,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780444508126.jpg?v=1694979942"},{"product_id":"algorithms-and-architectures-hardback-9780124438613","title":"Algorithms and Architectures (Hardback) 9780124438613","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eAlgorithms and Architectures\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cfont size=\"4\"\u003eCornelius T. Leondes (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780124438613\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 9 February 1998\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e460 pages\u003cbr\u003e22.9 x 15.1 x 2.9 cm, 0.84 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cp\u003eThis volume is the first diverse and comprehensive treatment of algorithms and architectures for the realization of neural network systems. It presents techniques and diverse methods in numerous areas of this broad subject. The book covers major neural network systems structures for achieving effective systems, and illustrates them with examples.\u003c\/p\u003e  \u003cp\u003eThis volume includes Radial Basis Function networks, the Expand-and-Truncate Learning algorithm for the synthesis of Three-Layer Threshold Networks, weight initialization, fast and efficient variants of Hamming and Hopfield neural networks, discrete time synchronous multilevel neural systems with reduced VLSI demands, probabilistic design techniques, time-based techniques, techniques for reducing physical realization requirements, and applications to finite constraint problems.\u003c\/p\u003e  \u003cp\u003eA unique and comprehensive reference for a broad array of algorithms and architectures, this book will be of use to practitioners, researchers, and students in industrial, manufacturing, electrical, and mechanical engineering, as well as in computer science and engineering.\u003c\/p\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003ci\u003eFreeman, Orr, and Saad,\u003c\/i\u003e Statistical Theories of Learning in Radial Basis Function Networks\u003ci\u003eKim, Park, Oh, and Han,\u003c\/i\u003e The Synthesis of Three-Layer Threshold Networks\u003ci\u003eLehtokangas, Salmela, Saarinen, and Kaski,\u003c\/i\u003e Weight Initialization Techniques\u003ci\u003eMeilijson, Ruppin, and Sipper,\u003c\/i\u003e Fast Computation in Hamming and Hopfield Networks\u003ci\u003eSi and Michel,\u003c\/i\u003e Multilevel Neurons\u003ci\u003eWatanabe and Fukumizu,\u003c\/i\u003e Probabilistic Design\u003ci\u003eTom and Tenorio,\u003c\/i\u003e Short Time Memory Problems\u003ci\u003eChung and Tsai,\u003c\/i\u003e Reliability Issue and Quantization Effects in Optical and Electronic Network Implementations of Hebbian-Type Associative Memories\u003ci\u003eMonfroglio,\u003c\/i\u003e Finite Constraint Satisfaction\u003ci\u003eChu,\u003c\/i\u003e Estimating the Dimensions of Manifolds Using Delaunay Diagrams\u003ci\u003eErsoy,\u003c\/i\u003e Parallel, Self-Organizing, Hierarchical Neural Network Systems\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Neural networks \u0026amp; fuzzy systems [\u003ca title=\"See our other books on Neural networks \u0026amp; fuzzy systems\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Neural%20networks%20\u0026amp;%20fuzzy%20systems%20%5BUYQN%5D%22\"\u003eUYQN\u003c\/a\u003e], Artificial intelligence [\u003ca title=\"See our other books on Artificial intelligence\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Artificial%20intelligence%20%5BUYQ%5D%22\"\u003eUYQ\u003c\/a\u003e], Computer architecture \u0026amp; logic design [\u003ca title=\"See our other books on Computer architecture \u0026amp; logic design\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Computer%20architecture%20\u0026amp;%20logic%20design%20%5BUYF%5D%22\"\u003eUYF\u003c\/a\u003e], Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Freshly Printed Books","offers":[{"title":"Default Title","offer_id":46649062850840,"sku":"9780124438613","price":61.39,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780124438613.jpg?v=1694096920"},{"product_id":"handbook-of-knot-theory-hardback-9780444514523","title":"Handbook of Knot Theory (Hardback) 9780444514523","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eHandbook of Knot Theory\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eCollection of survey articles covering key aspects of modern knot theory, written by renowned researchers.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eWilliam Menasco (Edited by), Morwen Thistlethwaite (Edited by)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780444514523, Elsevier Science\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 2 August 2005\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e502 pages\u003cbr\u003e24 x 16.5 x 3 cm, 1.05 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003eCHOICE – September 2006\u003cbr\u003e\u003cbr\u003eHandbook of Knot Theory, ed. By William Menasco and Morwen Thistlethwaite. Elsevier, 2005. 492 p bibl indexes ISBN 044451452X, $138.00\u003cbr\u003e\u003cbr\u003e\"Another title, perhaps “Surveys of Recent Advances in Knot Theory? might better suit this book. “Handbook? suggests, say, tabulations of those knots with few crossings in various classes, listed with their properties and invariants, everything supplemented by specifications of useful algorithms and key theorems that capture such regularities as emerge from all the data. But the era of such a handbook has passed. Indeed, the chapter by J. Hoste describes the state of the art concerning know enumeration. Although we lack an efficient, general recognition algorithm, existing techniques will classify the billions of distinct knots up to 20 crossings, and the mere dissemination of the results requires digital means and ingenuity. Other chapters will also immediately invite undergraduates, especially chapters by J.S. Burman and T.E. Brendle on braids, and L.H. Kauffman on knot diagrammatics. Overall, the ten chapters represent distinct views of the subject by some of its leading experts. More advanced students may read chapters by C. Adams and J. Weeks about hyperbolic (complements of) knots for an excellent entrée into Thurston’s geometrization program, or chapters G. Friedman and C. Livingston about spheres knotting in four-dimensional space, an intriguing topic rarely treated outside the journal literature. SUMMING UP: Highly recommended. General readers; lower-division undergraduates through professionals.\" \u003cb\u003e--D.V. Feldman, University of New Hampshire\u003c\/b\u003e\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThis book is a survey of current topics in the mathematical theory of knots.  For a mathematician, a knot is a closed loop in 3-dimensional space: imagine knotting an extension cord and then closing it up by inserting its plug into its outlet.  Knot theory is of central importance in pure and applied mathematics, as it stands at a crossroads of topology, combinatorics, algebra, mathematical physics and biochemistry.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHyperbolic Knots - Colin Adams\u003cbr\u003eBraids: A Survey - Joan S. Birman and Tara E. Brendle\u003cbr\u003eLegendrian and Transversal Knots - John B. Etnyre\u003cbr\u003eKnot Spinning - Greg Friedman\u003cbr\u003eThe Enumeration and Classification of Knots and Links - Jim Hoste\u003cbr\u003eKnot Diagrammatics - Louis H. Kauffman\u003cbr\u003eA Survey of Classical Knot Concordance - Charles Livingston\u003cbr\u003eKnot Theory of Complex Plane Curves - Lee Rudolph\u003cbr\u003eThin Position in the Theory of Classical Knots - Martin Scharlemann\u003cbr\u003eComputation of Hyperbolic Structures in Knot Theory - Jeff Weeks\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Algebraic topology [\u003ca title=\"See our other books on Algebraic topology\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Algebraic%20topology%20%5BPBPD%5D%22\"\u003ePBPD\u003c\/a\u003e], Topology [\u003ca title=\"See our other books on Topology\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Topology%20%5BPBP%5D%22\"\u003ePBP\u003c\/a\u003e], Discrete mathematics [\u003ca title=\"See our other books on Discrete mathematics\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Discrete%20mathematics%20%5BPBD%5D%22\"\u003ePBD\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Elsevier Science","offers":[{"title":"Default Title","offer_id":46649082249496,"sku":"9780444514523","price":113.78,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780444514523.jpg?v=1694980003"},{"product_id":"numerical-methods-for-linear-control-systems-hardback-9780122035906","title":"Numerical Methods for Linear Control Systems (Hardback) 9780122035906","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eNumerical Methods for Linear Control Systems\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eTextbook for courses on linear control which has diverse applications for electrical, mechanical, chemical, and aerospace engineering.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eBiswa Datta (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780122035906, Elsevier Science\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 24 February 2004\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e640 pages\u003cbr\u003e22.9 x 15.2 x 3.5 cm, 1.1 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e\"This is a very comprehensive book presenting the state-of-the-art in numerical techniques for linear systems and control. All the key developments in the area in the last two decades are covered in a clear, concise and practical manner. The accompanying MATLAB-based software implementations of the main algorithms will make the book particularly attractive to graduate students, researchers and practicing engineers concerned about numerical issues in control techniques. The book is very appropriate for one or more graduate courses on numerical techniques for control that could follow a conventional first course on linear system theory.\" \u003cb\u003e--Professor Rajni V. Patel, Chair of Department of Electrical and Computer Engineering, University of Western Ontario, London, Canada\u003cbr\u003e\u003c\/b\u003e\u003cbr\u003e\"This book provides a comprehensive treatment of system theory and numerical analysis written by an expert in both fields. It covers a wide range of topics and can be used for undergraduate and graduate courses in the increasingly important area of systems and computation\" \u003cb\u003e--Thanos Antoulas, Rice University\u003cbr\u003e\u003c\/b\u003e\u003cbr\u003e\"Datta has done a wonderful job in writing this difficult interdisciplinary book, blending scientific computing and numerical linear algebra with control and systems theory. In a very elegant manner Datta starts with essential components of numerical linear algebra, and moves to very useful advanced numerical algorithms and software for control systems. As an industrial mathematician involved in aerospace engineering research, I feel that the book will be an asset for researchers and practicing engineers who are using applied and computational mathematics to find solutions to complex industrial problems arising from well-established and emerging control applications\" \u003cb\u003e--Daniel J. Pierce - Boeing (ASK TIFFANY G. for use permissions)\u003c\/b\u003e\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003ci\u003eNumerical Methods for Linear Control Systems Design and Analysis\u003c\/i\u003e is an interdisciplinary textbook aimed at systematic descriptions and implementations of numerically-viable algorithms based on well-established, efficient and stable modern numerical linear techniques for mathematical problems arising in the design and analysis of linear control systems both for the first- and second-order models.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eIntroduction and Overview\u003cbr\u003e Review of Basic Concepts and Results from Theoretical Linear Algebra\u003cbr\u003e Fundamental Tools and Concepts from Numerical Linear Algebra\u003cbr\u003e Canonical Forms Obtained via Orthogonal Transformations\u003cbr\u003e Linear State Space Models and Solutions of the State Equations\u003cbr\u003e Contollability, Observability and Distance to Uncontrollability\u003cbr\u003e Stability, Inertia and Robust Stability\u003cbr\u003e Numerical Solutions and Conditioning of Lyapunov and Sylvester Equations\u003cbr\u003e Realization and Subspace Identification\u003cbr\u003e Feedback Stabilization, Eigenvalue Assignment and Optimal Control\u003cbr\u003e Numerical Methods and Conditioning of the Eigenvalue Assignment Problems\u003cbr\u003e State Estimation\u003cbr\u003e Numerical Solutions and Conditioning of Algebraic Riccati Equations\u003cbr\u003e Internal Balancing and Model Reduction\u003cbr\u003e Large-Scale Matrix Computations in Control: Krylov Subspace Methods\u003cbr\u003e Numerical Methods for Matrix-Second-Order Control Systems\u003cbr\u003e Existing Software for Control Systems Design and Analysis\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Mechanical engineering [\u003ca title=\"See our other books on Mechanical engineering\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mechanical%20engineering%20%5BTGB%5D%22\"\u003eTGB\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Academic Press","offers":[{"title":"Default Title","offer_id":46649195397400,"sku":"9780122035906","price":78.75,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780122035906_742b35fd-41c2-4243-9ce7-9defb288b4a1.jpg?v=1695006681"},{"product_id":"smart-sensors-networks-communication-technologies-and-intelligent-applications-paperback-9780128098592","title":"Smart Sensors Networks; Communication Technologies and Intelligent Applications (Paperback) 9780128098592","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eSmart Sensors Networks\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eCommunication Technologies and Intelligent Applications\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cem\u003e\u003cp\u003eShows what sensors networks are, how they work, and why they are valuable for numerous scientific and technological applications\u003c\/p\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eFatos Xhafa (Edited by), Fang-Yie Leu (Edited by), Li-Ling Hung (Edited by)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780128098592\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback, published 8 June 2017\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e394 pages\u003cbr\u003e23.4 x 19 x 2.5 cm, 0.79 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cp\u003e\u003ci\u003eSmart Sensors Networks: Communication Technologies and Intelligent Applications\u003c\/i\u003e explores the latest sensor and sensor networks techniques and applications, showing how networked wireless sensors are used to monitor and gather intelligence from our surrounding environment. \u003c\/p\u003e  \u003cp\u003eIt provides a systematic look at the unique characteristics of wireless sensor networks through their usage in a broad range of areas, including healthcare for the elderly, energy consumption, industrial automation, intelligent transportation systems, smart homes and cities, and more.\u003c\/p\u003e  \u003cp\u003eThe book shows how sensor-networks work and how they are applied to monitor our surrounding environment. It explores the most important aspects of modern sensors technologies, providing insights on the newest technologies and the systems needed to operate them. \u003c\/p\u003e  \u003cp\u003eReaders will find the book to be an entry point for understanding the fundamental differences between the various sensor technologies and their use in for different scenarios.\u003c\/p\u003e  \u003cp\u003e\u003cb\u003eIndexing: The books of this series are submitted to EI-Compendex and SCOPUS\u003c\/b\u003e\u003c\/p\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003cp\u003e1. Near Field Communication Technology and Applications 2. Radio Frequency Identification Principles and Applications 3. Sensor Data Compression 4. How to Integrate Sensors and the Internet of Things 5. Sensors and Intelligent Transportation 6. Smart Antennas for Sensors 7. Sensors-Based Emerging Technologies for Revealing Security and Privacy Issues 8. Sensors Applications in Smart Homes 9. Sensor Applications in Industrial Automation 10. How Sensors and Big Data Are Revolutionizing Business 11. How Wireless Sensor Networks help Elderly Healthcare 12. Energy Consumption in Sensors\u003c\/p\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Computer architecture \u0026amp; logic design [\u003ca title=\"See our other books on Computer architecture \u0026amp; logic design\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Computer%20architecture%20\u0026amp;%20logic%20design%20%5BUYF%5D%22\"\u003eUYF\u003c\/a\u003e], Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Computer science [\u003ca title=\"See our other books on Computer science\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Computer%20science%20%5BUY%5D%22\"\u003eUY\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Freshly Printed Books","offers":[{"title":"Default Title","offer_id":46649755238680,"sku":"9780128098592","price":90.69,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780128098592.jpg?v=1694103331"},{"product_id":"digital-moving-pictures-coding-and-transmission-on-atm-networks-hardback-9780444817860","title":"Digital Moving Pictures - Coding and Transmission on ATM Networks (Hardback) 9780444817860","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eDigital Moving Pictures - Coding and Transmission on ATM Networks\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cfont size=\"4\"\u003eJ.-P. Leduc (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780444817860, Elsevier Science\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 22 August 1994\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e0 pages\u003cbr\u003e24.4 x 17.5 x 1.3 cm, 1.16 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eImage communication technologies have advanced rapidly in recent years and the book series, Advances in Image Communication is dedicated to documenting these developments. Third in the series, this publication contributes as effectively as its forerunners to the multidisciplinary overview afforded by the series as a whole. At the same time, it stands alone as a comprehensive synopsis of its own particular area of interest.\u003cp\u003eThe book specifically explores two complementary topics, namely:\u003c\/p\u003e\n\u003cp\u003ethe coding algorithms made to compress the data rate of digital moving-picture sequences (video-telephony, television [TV] and high-definition television [HDTV]) and\u003c\/p\u003e\n\u003cp\u003ethe transmission on Asynchronous Transfer Mode [ATM] networks (packet-switching transmission media). It provides an in-depth view of the current state-of-the-art and endeavors to stimulate increasing research efforts for the future.\u003c\/p\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003cb\u003eList of Figures. List of Tables. Introduction to ATM Networks.\u003c\/b\u003e Introduction. Data Communications on Networks. Broad-band ISDN. Potential User Services. ATM-OSI Layers. Cell Structure. ATM Switching Techniques. ATM Multiplexers. ATM Network Architecture. Traffic Models. Traffic Descriptors. ATM Network Management. Conclusions. Bibliography. ATM Terminology. \u003cb\u003eTV and HDTV Coding Algorithms.\u003c\/b\u003e Introduction. Sampling Theorem and Spectra. Theoretical Introduction to Coding. Techniques of Signal Decomposition. Lapped Orthogonal Transforms. Wavelet Transform and Multiresolution. Quantization. Variable-Length Entropy Coding. Quantizer Rate-Distortion Function. Extensions of the OSI Layering. TV Encoding Architectures. Conclusions. Bibliography. \u003cb\u003eBit Rate Models.\u003c\/b\u003e Introduction. Experiment with Actual Time Digital TV. Complete Model Description. Statistical Modeling Approach. Statistics at the Programme Layer. Statistics on other Coders. Conclusions. Bibliography. Markov Modulated Poisson Processes. Video Signal Models. Auto-regressive Estimation of DNSPP. Detection of Scene Changes. \u003cb\u003eCoding Control Algorithms.\u003c\/b\u003e Introduction. Loop with Linear Feedback Response. Regulators in the Feedback Chain. Optimum Control Algorithm. Regulators against Controllers. The Use of Neural Networks. Conclusions. Bibliography. Complements on the Non-Linearities. \u003cb\u003eStatistical Multiplexing.\u003c\/b\u003e Introduction. Superposition of ATM Traffics. Queueing Models for ATM Multiplexers. Performances of ATM Multiplexers. Conclusions. Bibliography. Properties of Renewal Processes. Autocovariance of Counting Processes. \u003cb\u003eATM Adaptation Layer.\u003c\/b\u003e Introduction. Cell Losses and Bit Errors. Synchronization of Decoders. Conclusions. Bibliography. \u003cb\u003eTransmission on ATM Networks.\u003c\/b\u003e Introduction. Principle of Queueing Networks. Allocation of Network Resources. Enforcement Actions. Switching Operations on Traffics. Input-Output Relations in Multiplexers. Congestion Control Strategies\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Image processing [\u003ca title=\"See our other books on Image processing\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Image%20processing%20%5BUYT%5D%22\"\u003eUYT\u003c\/a\u003e], Signal processing [\u003ca title=\"See our other books on Signal processing\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Signal%20processing%20%5BUYS%5D%22\"\u003eUYS\u003c\/a\u003e], Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Computer networking \u0026amp; communications [\u003ca title=\"See our other books on Computer networking \u0026amp; communications\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Computer%20networking%20\u0026amp;%20communications%20%5BUT%5D%22\"\u003eUT\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Elsevier Science","offers":[{"title":"Default Title","offer_id":46651522253080,"sku":"9780444817860","price":43.99,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780444817860.jpg?v=1694113693"},{"product_id":"algorithms-and-complexity-hardback-9780444880710","title":"Algorithms and Complexity (Hardback) 9780444880710","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eAlgorithms and Complexity\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cfont size=\"4\"\u003eBozzano G Luisa (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780444880710, Elsevier Science\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 12 September 1990\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e260 pages\u003cbr\u003e24.4 x 17.5 x 2.2 cm, 1.97 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e\"...providing professionals and students with a comprehensive overview of the main results and developments in this evolving field.\" \u003cb\u003e--L'Enseignement Mathematique\u003cbr\u003e\u003c\/b\u003e\u003cbr\u003eW. Kern\u003cbr\u003e\"...one of the most useful and needed publications in the field.\"\u003cb\u003e --Optima\u003c\/b\u003e\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThis first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eMachine Models and Simulations (P. van Emde Boas). A Catalog of Complexity Classes (D.S. Johnson). Machine-Independent Complexity Theory (J.I. Seiferas). Kolmogorov Complexity and its Applications (M. Li, P.M.B. Vit\u0026amp;aacute\u003cbr\u003enyi). Algorithms for Finding Patterns in Strings (A.V. Aho). Data Structures (K. Mehlhorn, A. Tsakalidis). Computational Geometry (F.F. Yao). Algorithmic Motion Planning in Robotics (J.T. Schwartz, M. Sharir). Average-Case Analysis of Algorithms and Data Structures (J.S. Vitter, Ph. Flajolet). Graph Algorithms (J. van Leeuwen). Algebraic Complexity Theory (V. Strassen). Algorithms in Number Theory (A.K. Lenstra, H.W. Lenstra Jr.). Cryptography (R. Rivest). The Complexity of Finite Functions (R.B. Boppana, M. Sipser). Communication Networks (N. Pippenger). VLSI Theory (Th. Lengauer). Parallel Algorithms for Shared-Memory Machines (R.M. Karp, V. Ramachandran). General Purpose Parallel Architectures (L.G. Valiant). Subject Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Combinatorics \u0026amp; graph theory [\u003ca title=\"See our other books on Combinatorics \u0026amp; graph theory\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Combinatorics%20\u0026amp;%20graph%20theory%20%5BPBV%5D%22\"\u003ePBV\u003c\/a\u003e], Optimization [\u003ca title=\"See our other books on Optimization\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Optimization%20%5BPBU%5D%22\"\u003ePBU\u003c\/a\u003e], Discrete mathematics [\u003ca title=\"See our other books on Discrete mathematics\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Discrete%20mathematics%20%5BPBD%5D%22\"\u003ePBD\u003c\/a\u003e], Mathematical logic [\u003ca title=\"See our other books on Mathematical logic\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20logic%20%5BPBCD%5D%22\"\u003ePBCD\u003c\/a\u003e], Mathematical foundations [\u003ca title=\"See our other books on Mathematical foundations\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20foundations%20%5BPBC%5D%22\"\u003ePBC\u003c\/a\u003e], Cybernetics \u0026amp; systems theory [\u003ca title=\"See our other books on Cybernetics \u0026amp; systems theory\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Cybernetics%20\u0026amp;%20systems%20theory%20%5BGPFC%5D%22\"\u003eGPFC\u003c\/a\u003e], Information theory [\u003ca title=\"See our other books on Information theory\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Information%20theory%20%5BGPF%5D%22\"\u003eGPF\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Elsevier Science","offers":[{"title":"Default Title","offer_id":46651539882264,"sku":"9780444880710","price":45.99,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780444880710_e0c94947-1696-4adc-80b4-113e7a0ebf80.jpg?v=1694987468"}],"url":"https:\/\/freshlyprintedbooks.co.uk\/collections\/mathematical-theory-of-computation.oembed","provider":"Freshly Printed Books","version":"1.0","type":"link"}