{"title":"Progress In Computer Science And Applied Logic","description":null,"products":[{"product_id":"introduction-to-quantum-computing-algorithms-book-arthur-o-pittenger-9780817641276","title":"An Introduction to Quantum Computing Algorithms","description":"In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com­ puter. Since the difficulty of the factoring problem is crucial for the se­ curity of a public key encryption system, interest (and funding) in quan­ tum computing and quantum computation suddenly blossomed. Quan­ tum computing had arrived. The study of the role of quantum mechanics in the theory of computa­ tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec­ tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of \"quantum machines\" one could imitate any quantum system.","brand":"WoB","offers":[{"title":"US \/ GOOD \/ SBYB","offer_id":50362716324113,"sku":"CIN0817641270G","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52139738693905,"sku":"NLS9780817641276","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":52489729736977,"sku":"CIN0817641270VG","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0817641270.jpg?v=1750979426"},{"product_id":"logic-for-computer-scientists-book-uwe-schoening-9780817634537","title":"Logic for Computer Scientists","description":"This book introduces the notions and methods of formal logic from a computer science standpoint, covering propositional logic, predicate logic, and foundations of logic programming. The classic text is replete with illustrative examples and exercises. It presents applications and themes of computer science research such as resolution, automated deduction, and logic programming in a rigorous but readable way. The style and scope of the work, rounded out by the inclusion of exercises, make this an excellent textbook for an advanced undergraduate course in logic for computer scientists.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":50460213805329,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ GOOD \/ SBYB","offer_id":50460214657297,"sku":"CIN0817634533G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ LIKE_NEW \/ SBYB","offer_id":52620519440657,"sku":"CIN0817634533LN","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0817634533.jpg?v=1786130896"},{"product_id":"temporal-type-theory-book-patrick-schultz-9783030007034","title":"Temporal Type Theory","description":"This innovative monograph explores a new mathematical formalism in higher-order temporal logic for proving properties about the behavior of systems.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51064343593233,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51064346181905,"sku":"NIN9783030007034","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52666123059473,"sku":"NLS9783030007034","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ GOOD \/ SBYB","offer_id":54279939358993,"sku":"CIN3030007030G","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3030007030.jpg?v=1786028994"},{"product_id":"applied-probability-computer-science-the-interface-volume-1-book-ralph-l-disney-9780817630676","title":"Applied Probability-Computer Science: The Interface Volume 1","description":"These two volumes are the Proceedings of the first special interest meeting instigated and organized by the joint Technical Section and College in Applied Probability of ORSA and THlS. This meeting, which took place January 5-7, 1981 at Florida Atlantic University in Boca Raton, Florida, had the same name as these Proceedings: Applied Probability-Computer Science, the Interface. The goal of that conference was to achieve a meeting of, and a cross fertilization between, two groups of researchers who, from different starting points, had come to work on similar problems, often developing similar methodologies and tools. One of these groups are the applied probabilists, many of whom consider their field an offspring of mathematics, and who find their motivation in many areas of application. The other is that group of computer scientists who, over the years, have found an increasing need in their work for the use of probabilistic models. The most visible area of common methodology between these two groups is networks of queues, Hhich by itself could have been the theme of an entire conference. FunctionQl areas which are, or are becoming, sources of exciting problems are computer performance analysis, data base analysis, analysis of communication protocols, data networks, and mixed voice-data telephone networks. The reader can add to this list by going through the papers in these Proceedings.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52121883509009,"sku":"NLS9780817630676","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52740322820369,"sku":"NIN9780817630676","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817630676.jpg?v=1757435658"},{"product_id":"automata-theory-and-its-applications-book-bakhadyr-khoussainov-9780817642075","title":"Automata Theory and its Applications","description":"The theory of finite automata on finite stings, infinite strings, and trees has had a dis- tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us- ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52124140929297,"sku":"NLS9780817642075","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817642075.jpg?v=1786614469"},{"product_id":"feasible-mathematics-book-sr-buss-9780817634834","title":"Feasible Mathematics","description":"Feasible Mathematics includes both the study of feasible computation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52124780593425,"sku":"NLS9780817634834","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817634834.jpg?v=1785965060"},{"product_id":"evolution-of-programs-book-dershowitz-9780817631710","title":"The Evolution of Programs","description":"-Ecclesiastes 12:12 Programs are invariably subjected to many rorms or transrormation. After an initial version of a program has been designed and developed, it undergoes debugging and certification. In addition, most long-lived pro- grams have a liCe-cycle that includes modifications to meet amended specifications and extensions for expanded capabilities. Such evolution- ary aspects of programming are the topic of this monograph. We present rormal methods for manipulating programs and illustrate their applica- tion with numerous examples. Such methods could be incorporated in semi-automated programming environments, where they would serve to ease the burden on the programmer. We begin by describing a method whereby a given program that achieves one goal can be modified to achieve a different goal or a pro- gram that computes wrong results can be debugged to achieve the 2 Preface intended results. The abstraction of a set of cognate programs to obtain a program schema, and the instantiation of abstract schemata to solve concrete problems, are approached from the same perspective. In addition, we describe synthesis rules for generating code from specifications and annotation rules for making assertions about code. The synthesis rules may be used when a program is first being developed, or when, in the course of modifying a program, the need arises to rewrite a program segment. Annotation rules may be used for the purpose of determining what an incorrect program really does before attempting to debug it or how a correct program works before attempting to modify it.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52135047725329,"sku":"NLS9780817631710","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817631710.jpg?v=1785969575"},{"product_id":"applied-probability-computer-science-the-interface-volume-1-book-ralph-l-disney-9781461257936","title":"Applied Probability-Computer Science: The Interface Volume 1","description":"These two volumes are the Proceedings of the first special interest meeting instigated and organized by the joint Technical Section and College in Applied Probability of ORSA and THlS. This meeting, which took place January 5-7, 1981 at Florida Atlantic University in Boca Raton, Florida, had the same name as these Proceedings: Applied Probability-Computer Science, the Interface. The goal of that conference was to achieve a meeting of, and a cross fertilization between, two groups of researchers who, from different starting points, had come to work on similar problems, often developing similar methodologies and tools. One of these groups are the applied probabilists, many of whom consider their field an offspring of mathematics, and who find their motivation in many areas of application. The other is that group of computer scientists who, over the years, have found an increasing need in their work for the use of probabilistic models. The most visible area of common methodology between these two groups is networks of queues, Hhich by itself could have been the theme of an entire conference. FunctionQl areas which are, or are becoming, sources of exciting problems are computer performance analysis, data base analysis, analysis of communication protocols, data networks, and mixed voice-data telephone networks. The reader can add to this list by going through the papers in these Proceedings.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52136239497489,"sku":"NLS9781461257936","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781461257936.jpg?v=1757553423"},{"product_id":"cryptographic-applications-of-analytic-number-theory-book-igor-shparlinski-9783034894159","title":"Cryptographic Applications of Analytic Number Theory","description":"The book introduces new techniques that imply rigorous lower bounds on the com­ plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num­ bers of solutions of some polynomial equations over finite fields and residue rings. Other number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI\/2+O:). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52140759875857,"sku":"NLS9783034894159","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783034894159.jpg?v=1757575466"},{"product_id":"real-time-control-of-walking-book-md-donner-9780817633325","title":"Real-Time Control of Walking","description":"I wonder whether Karel Capek imagined in 1923 that by his use of the Czech word for forced labor, rohota, to name the android creations of Mr. Rossum he was naming an important technology of his future. Perhaps it wasn't Capek's work directly, but rather its influence on Lang's movie Metropolis in 1926 that introduced the term to the popular consciousness. In the public mind ever since a robot has been a me chanical humanoid, tireless and somewhat sinister. In the research community the field of robotics has recently reached large size and respectability, but without answering the question, What is robotics? or perhaps, What is a robot? There is no real consensus for a precise definition of robotics. I suppose that Capekian mechanical men, if one could build them, are robots, but after that there is little agreement. Rather than try to enumerate all of the things that are and are not robots, I will try to characterize the kinds of features that make a system a robot. A candidate definition of a robot is a system intended to achieve mechanical action, with sensory feedback from the world to guide the actions and a sophisticated con trol system connecting the sensing and the actions.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52140784910609,"sku":"NLS9780817633325","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817633325.jpg?v=1786614273"},{"product_id":"coding-cryptography-and-combinatorics-book-keqin-feng-9783034896023","title":"Coding, Cryptography and Combinatorics","description":"It has long been recognized that there are fascinating connections between cod- ing theory, cryptology, and combinatorics. Therefore it seemed desirable to us to organize a conference that brings together experts from these three areas for a fruitful exchange of ideas. We decided on a venue in the Huang Shan (Yellow Mountain) region, one of the most scenic areas of China, so as to provide the additional inducement of an attractive location. The conference was planned for June 2003 with the official title Workshop on Coding, Cryptography and Combi- natorics (C 2003). Those who are familiar with events in East Asia in the first half of 2003 can guess what happened in the end, namely the conference had to be cancelled in the interest of the health of the participants. The SARS epidemic posed too serious a threat. At the time of the cancellation, the organization of the conference was at an advanced stage: all invited speakers had been selected and all abstracts of contributed talks had been screened by the program committee. Thus, it was de- cided to call on all invited speakers and presenters of accepted contributed talks to submit their manuscripts for publication in the present volume. Altogether, 39 submissions were received and subjected to another round of refereeing. After care- ful scrutiny, 28 papers were accepted for publication.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52142922334481,"sku":"NLS9783034896023","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783034896023.jpg?v=1757581991"},{"product_id":"proof-theory-for-general-unification-book-w-snyder-9780817635930","title":"A Proof Theory for General Unification","description":"In this monograph we study two generalizations of standard unification, E-unification and higher-order unification, using an abstract approach orig- inated by Herbrand and developed in the case of standard first-order unifi- cation by Martelli and Montanari. The formalism presents the unification computation as a set of non-deterministic transformation rules for con- verting a set of equations to be unified into an explicit representation of a unifier (if such exists). This provides an abstract and mathematically elegant means of analysing the properties of unification in various settings by providing a clean separation of the logical issues from the specification of procedural information, and amounts to a set of 'inference rules' for unification, hence the title of this book. We derive the set of transformations for general E-unification and higher- order unification from an analysis of the sense in which terms are 'the same' after application of a unifying substitution. In both cases, this results in a simple extension of the set of basic transformations given by Herbrand- Martelli-Montanari for standard unification, and shows clearly the basic relationships of the fundamental operations necessary in each case, and thus the underlying structure of the most important classes of term unifi- cation problems.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52143367618833,"sku":"NLS9780817635930","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":53558368960785,"sku":"NIN9780817635930","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817635930.jpg?v=1786614793"},{"product_id":"symbolic-rewriting-techniques-book-manuel-bronstein-9783034897792","title":"Symbolic Rewriting Techniques","description":"Symbolic rewriting techniques are methods for deriving consequences from systems of equations, and are of great use when investigating the structure of the solutions. Such techniques appear in many important areas of research within computer algebra: - the Knuth-Bendix completion for groups, monoids and general term-rewriting systems, - the Buchberger algorithm for Grobner bases, - the Ritt-Wu characteristic set method for ordinary differential equations, and - the Riquier-Janet method for partial differential equations. This volume contains invited and contributed papers to the Symbolic Rewriting Techniques workshop, which was held at the Centro Stefano Franscini in Ascona, Switzerland, from April 30 to May 4, 1995. That workshop brought together 40 researchers from various areas of rewriting techniques, the main goal being the investigation of common threads and methods. Following the workshops, each contribution was formally refereed and 14 papers were selected for publication.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52143699984657,"sku":"NLS9783034897792","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783034897792.jpg?v=1785911109"},{"product_id":"perspectives-in-computational-complexity-book-manindra-agrawal-9783319054452","title":"Perspectives in Computational Complexity","description":"This book brings together contributions by leading researchers in computational complexity theory written in honor of Somenath Biswas on the occasion of his sixtieth birthday. They discuss current trends and exciting developments in this flourishing area of research and offer fresh perspectives on various aspects of complexity theory. The topics covered include arithmetic circuit complexity, lower bounds and polynomial identity testing, the isomorphism conjecture, space-bounded computation, graph isomorphism, resolution and proof complexity, entropy and randomness. Several chapters have a tutorial flavor. The aim is to make recent research in these topics accessible to graduate students and senior undergraduates in computer science and mathematics. It can also be useful as a resource for teaching advanced level courses in computational complexity.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52146280661265,"sku":"NLS9783319054452","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783319054452.jpg?v=1786700333"},{"product_id":"cryptographic-applications-of-analytic-number-theory-book-igor-shparlinski-9783764366544","title":"Cryptographic Applications of Analytic Number Theory","description":"The book introduces new techniques that imply rigorous lower bounds on the com­ plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num­ bers of solutions of some polynomial equations over finite fields and residue rings. Other number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI\/2+O:). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52148250575121,"sku":"NLS9783764366544","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783764366544.jpg?v=1786791421"},{"product_id":"coding-cryptography-and-combinatorics-book-keqin-feng-9783764324292","title":"Coding, Cryptography and Combinatorics","description":"It has long been recognized that there are fascinating connections between cod- ing theory, cryptology, and combinatorics. Therefore it seemed desirable to us to organize a conference that brings together experts from these three areas for a fruitful exchange of ideas. We decided on a venue in the Huang Shan (Yellow Mountain) region, one of the most scenic areas of China, so as to provide the additional inducement of an attractive location. The conference was planned for June 2003 with the official title Workshop on Coding, Cryptography and Combi- natorics (C 2003). Those who are familiar with events in East Asia in the first half of 2003 can guess what happened in the end, namely the conference had to be cancelled in the interest of the health of the participants. The SARS epidemic posed too serious a threat. At the time of the cancellation, the organization of the conference was at an advanced stage: all invited speakers had been selected and all abstracts of contributed talks had been screened by the program committee. Thus, it was de- cided to call on all invited speakers and presenters of accepted contributed talks to submit their manuscripts for publication in the present volume. Altogether, 39 submissions were received and subjected to another round of refereeing. After care- ful scrutiny, 28 papers were accepted for publication.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52148341965073,"sku":"NLS9783764324292","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783764324292.jpg?v=1785978043"},{"product_id":"number-theoretic-methods-in-cryptography-book-igor-shparlinski-9783764358884","title":"Number Theoretic Methods in Cryptography","description":"The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de­ grees and orders of • polynomials; • algebraic functions; • Boolean functions; • linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf­ ficiently many points (the number of points can be as small as pI\/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right­ most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de­ gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52344066605329,"sku":"NLS9783764358884","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52762248413457,"sku":"NIN9783764358884","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783764358884.jpg?v=1758174294"},{"product_id":"learning-and-geometry-computational-approaches-book-david-kueker-9781461286462","title":"Learning and Geometry: Computational Approaches","description":"The field of computational learning theory arose out of the desire to for mally understand the process of learning. As potential applications to artificial intelligence became apparent, the new field grew rapidly. The learning of geo metric objects became a natural area of study. The possibility of using learning techniques to compensate for unsolvability provided an attraction for individ uals with an immediate need to solve such difficult problems. Researchers at the Center for Night Vision were interested in solving the problem of interpreting data produced by a variety of sensors. Current vision techniques, which have a strong geometric component, can be used to extract features. However, these techniques fall short of useful recognition of the sensed objects. One potential solution is to incorporate learning techniques into the geometric manipulation of sensor data. As a first step toward realizing such a solution, the Systems Research Center at the University of Maryland, in conjunction with the Center for Night Vision, hosted a Workshop on Learning and Geometry in January of 1991. Scholars in both fields came together to learn about each others' field and to look for common ground, with the ultimate goal of providing a new model of learning from geometrical examples that would be useful in computer vision. The papers in the volume are a partial record of that meeting.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52404267909393,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52404268499217,"sku":"NLS9781461286462","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781461286462.jpg?v=1785898800"},{"product_id":"graph-based-proof-procedures-for-horn-clauses-book-raatz-9780817635305","title":"Graph-Based Proof Procedures for Horn Clauses","description":"The origins of this monograph lie in my Ph.D. dissertation of 1987 at the University of Pennsylvania, which was concerned with proof procedures for the Horn clause subset of logic. The rise of logic programming has made this an important area of study. All Prologs are based on a variant of resolution, and inherit various properties related to this proof method. This monograph studies the paradigm of logic programming in the context of graph-based proof procedures which are unrelated to resolution. The monograph is not a general introduction to logic programming, although it is self-contained with respect to the mathematics used. It should appeal to the computer scientist or mathematician interested in the general area we now call computational logic. A large part of the monograph is devoted to detailed proofs that the methods we present are sound and complete, which in the context of the logic programming, means that the operational and denotational semantics agree.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52407783555345,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52407784276241,"sku":"NLS9780817635305","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817635305.jpg?v=1758773190"},{"product_id":"bounded-queries-in-recursion-theory-book-william-levine-9781461268482","title":"Bounded Queries in Recursion Theory","description":"One of the major concerns of theoretical computer science is the classifi- cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52409345769745,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52409350455569,"sku":"NLS9781461268482","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781461268482.jpg?v=1758774887"},{"product_id":"logical-methods-book-john-n-crossley-9780817636906","title":"Logical Methods","description":"Anil Nerode, Director of the Mathematics Institute at Cornell, USA, is one of the most influential logicians in the world. This volume, published in his honour, contains much new and significant work. The papers in this book are principally concerned with mathematical logic and some of its applications in computing. The book contains papers on recursion theory, intuitionism, computability in group theory, recursive model theory, reverse mathematics and the extraction of programs from proofs. A survey of Nerode's technical achievements over the last 30 years is also included. In particular, the book features papers on new developments in the understanding of the properties of intuitionistic set theory and intuitionistic analysis, the extension of computability in ordinary mathematics pioneered by Marian Boykan Pour-El and Ian Richards, the proof-theoretic strength of a long-standing conjecture of Fraisse and an extension of, and further account of, the Curry-Howard method of extracting programs from logical proofs. The papers in general arose from the conference, \"Logical Methods in Mathematics and Computer Science.\nA Symposium in Honor of Anil Nerode on the Occasion of his Sixtieth Birthday\", held at the Mathematical Sciences Institute at Cornell University, from June 1-3, 1992.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52425808150801,"sku":"NLS9780817636906","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817636906.jpg?v=1759155868"},{"product_id":"bounded-queries-in-recursion-theory-book-william-levine-9780817639662","title":"Bounded Queries in Recursion Theory","description":"The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52426198155537,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52426198876433,"sku":"NLS9780817639662","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817639662.jpg?v=1759157002"},{"product_id":"interpolating-cubic-splines-book-gary-d-knott-9781461270928","title":"Interpolating Cubic Splines","description":"A spline is a thin flexible strip composed of a material such as bamboo or steel that can be bent to pass through or near given points in the plane, or in 3-space in a smooth manner. Mechanical engineers and drafting specialists find such (physical) splines useful in designing and in drawing plans for a wide variety of objects, such as for hulls of boats or for the bodies of automobiles where smooth curves need to be specified. These days, physi- cal splines are largely replaced by computer software that can compute the desired curves (with appropriate encouragment). The same mathematical ideas used for computing spline curves can be extended to allow us to compute spline surfaces. The application ofthese mathematical ideas is rather widespread. Spline functions are central to computer graphics disciplines. Spline curves and surfaces are used in computer graphics renderings for both real and imagi- nary objects. Computer-aided-design (CAD) systems depend on algorithms for computing spline functions, and splines are used in numerical analysis and statistics. Thus the construction of movies and computer games trav- els side-by-side with the art of automobile design, sail construction, and architecture; and statisticians and applied mathematicians use splines as everyday computational tools, often divorced from graphic images.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52426652647697,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52426653368593,"sku":"NLS9781461270928","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781461270928.jpg?v=1759158552"},{"product_id":"cryptography-and-computational-number-theory-book-kwok-y-lam-9783034895071","title":"Cryptography and Computational Number Theory","description":"This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapore during the week of November 22-26, 1999. The idea for this workshop grew out of the recognition of the recent, rapid development in various areas of cryptography and computational number the ory.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52426937827601,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52426938646801,"sku":"NLS9783034895071","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783034895071.jpg?v=1759159447"},{"product_id":"introduction-to-quantum-computing-algorithms-book-arthur-o-pittenger-9781461271277","title":"An Introduction to Quantum Computing Algorithms","description":"In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com­ puter. Since the difficulty of the factoring problem is crucial for the se­ curity of a public key encryption system, interest (and funding) in quan­ tum computing and quantum computation suddenly blossomed. Quan­ tum computing had arrived. The study of the role of quantum mechanics in the theory of computa­ tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec­ tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of \"quantum machines\" one could imitate any quantum system.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52427007066385,"sku":"NLS9781461271277","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781461271277.jpg?v=1785967991"},{"product_id":"proof-theory-for-general-unification-book-w-snyder-9781461267584","title":"A Proof Theory for General Unification","description":"In this monograph we study two generalizations of standard unification, E-unification and higher-order unification, using an abstract approach orig- inated by Herbrand and developed in the case of standard first-order unifi- cation by Martelli and Montanari. The formalism presents the unification computation as a set of non-deterministic transformation rules for con- verting a set of equations to be unified into an explicit representation of a unifier (if such exists). This provides an abstract and mathematically elegant means of analysing the properties of unification in various settings by providing a clean separation of the logical issues from the specification of procedural information, and amounts to a set of 'inference rules' for unification, hence the title of this book. We derive the set of transformations for general E-unification and higher- order unification from an analysis of the sense in which terms are 'the same' after application of a unifying substitution. In both cases, this results in a simple extension of the set of basic transformations given by Herbrand- Martelli-Montanari for standard unification, and shows clearly the basic relationships of the fundamental operations necessary in each case, and thus the underlying structure of the most important classes of term unifi- cation problems.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52428426969361,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52428428050705,"sku":"NLS9781461267584","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781461267584.jpg?v=1786442960"},{"product_id":"automata-theory-and-its-applications-book-bakhadyr-khoussainov-9781461266457","title":"Automata Theory and its Applications","description":"The theory of finite automata on finite stings, infinite strings, and trees has had a dis- tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us- ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52428871368977,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52428872122641,"sku":"NLS9781461266457","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781461266457.jpg?v=1786105374"},{"product_id":"number-theoretic-methods-in-cryptography-book-igor-shparlinski-9783034897235","title":"Number Theoretic Methods in Cryptography","description":"The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52428938445073,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52428939002129,"sku":"NLS9783034897235","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783034897235.jpg?v=1759165603"},{"product_id":"mathematical-logic-book-wei-li-9783034808613","title":"Mathematical Logic","description":"\u003cp\u003eMathematical logic is a branch of mathematics that takes axiom systems and mathematical proofs as its objects of study. This book shows how it can also provide a foundation for the development of information science and technology. The first five chapters systematically present the core topics of classical mathematical logic, including the syntax and models of first-order languages, formal inference systems, computability and representability, and Gödel’s theorems. The last five chapters present extensions and developments of classical mathematical logic, particularly the concepts of version sequences of formal theories and their limits, the system of revision calculus, proschemes (formal descriptions of proof methods and strategies) and their properties, and the theory of inductive inference. All of these themes contribute to a formal theory of axiomatization and its application to the process of developing information technology and scientific theories. The book also describes the paradigm of three kinds of language environments for theories and it presents the basic properties required of a meta-language environment. Finally, the book brings these themes together by describing a workflow for scientific research in the information era in which formal methods, interactive software and human invention are all used to their advantage.\u003c\/p\u003e\u003cp\u003eThe second edition of the book includes major revisions on the proof of the completeness theorem of the Gentzen system and new contents on the logic of scientific discovery, R-calculus without cut, and the operational semantics of program debugging.\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eThis book represents a valuable reference for graduate and undergraduate students and researchers in mathematics, information science and technology, and other relevant areas of natural sciences. Its first five chapters serve as an undergraduate text in mathematical logic and the last five chapters are addressed to graduate students inrelevant disciplines.\u003c\/p\u003e","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52429021118737,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52429022069009,"sku":"NLS9783034808613","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783034808613.jpg?v=1786106061"},{"product_id":"graph-theoretic-approach-to-enterprise-network-dynamics-book-horst-bunke-9780817644857","title":"A Graph-Theoretic Approach to Enterprise Network Dynamics","description":"This monograph treats the application of numerous graph-theoretic algorithms to a comprehensive analysis of dynamic enterprise networks. It covers a number of elegant applications of traditional graph theory algorithms and techniques to network dynamics analysis.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52430051574033,"sku":"NLS9780817644857","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52740296343825,"sku":"NIN9780817644857","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817644857.jpg?v=1785964926"},{"product_id":"applied-probability-computer-science-the-interface-book-ralph-l-disney-9780817630935","title":"Applied Probability- Computer Science: The Interface","description":"These two volumes are the Proceedings of the first special interest meeting instigated and organized by the joint Technical Section and College in Applied Probability of ORSA and THlS. This meeting, which took place January 5-7, 1981 at Florida Atlantic University in Boca Raton, Florida, had the same name as these Proceedings: Applied Probability-Computer Science, the Interface. The goal of that conference was to achieve a meeting of, and a cross fertilization between, two groups of researchers who, from different starting points, had come to work on similar problems, often developing similar methodologies and tools. One of these groups are the applied probabilists, many of whom consider their field an offspring of mathematics, and who find their motivation in many areas of application. The other is that group of computer scientists who, over the years, have found an increasing need in their work for the use of probabilistic models. The most visible area of common methodology between these two groups is networks of queues, Hhich by itself could have been the theme of an entire conference. FunctionQl areas which are, or are becoming, sources of exciting problems are computer performance analysis, data base analysis, analysis of communication protocols, data networks, and mixed voice-data telephone networks. The reader can add to this list by going through the papers in these Proceedings.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52430521237777,"sku":"NLS9780817630935","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52740323803409,"sku":"NIN9780817630935","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817630935.jpg?v=1786034610"},{"product_id":"perspectives-in-computational-complexity-book-manindra-agrawal-9783319350585","title":"Perspectives in Computational Complexity","description":"This book brings together contributions by leading researchers in computational complexity theory written in honor of Somenath Biswas on the occasion of his sixtieth birthday. They discuss current trends and exciting developments in this flourishing area of research and offer fresh perspectives on various aspects of complexity theory. The topics covered include arithmetic circuit complexity, lower bounds and polynomial identity testing, the isomorphism conjecture, space-bounded computation, graph isomorphism, resolution and proof complexity, entropy and randomness. Several chapters have a tutorial flavor. The aim is to make recent research in these topics accessible to graduate students and senior undergraduates in computer science and mathematics. It can also be useful as a resource for teaching advanced level courses in computational complexity.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52430521762065,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52430522515729,"sku":"NLS9783319350585","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783319350585.jpg?v=1759169934"},{"product_id":"lecture-notes-on-bucket-algorithms-book-devroye-9780817633288","title":"Lecture Notes on Bucket Algorithms","description":"Hashing algorithms scramble data and create pseudo-uniform data distribu- tions. Bucket algorithms operate on raw untransformed data which are parti- tioned Into groups according to membership In equl-slzed d-dlmenslonal hyperrec- tangles, called cells or buckets. The bucket data structure Is rather sensitive to the distribution of the data. In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the dis- tribution of the data. The results are Illustrated on standard searching, sorting and selection problems, as well as on a variety of problems In computational geometry and operations research. The notes grew partially from a graduate course on probability theory In computer science. I wish to thank Elizabeth Van Gulick for her help with the manuscript, and David Avis, Hanna AYukawa, Vasek Chvatal, Beatrice Devroye, Hossam EI Glndy, Duncan McCallum, Magda McCallum, Godfrled Toussaint and Sue Whltesldesfor making the School of Computer Science at McGill University such an enjoyable place. The work was supported by NSERC Grant A3456 and by FCAC Grant EQ-1679. INTRODUCTION 1 INTRODUCTION It Is not a secret that methods based upon the truncation of data have good expected time performance. For example, for nice distributions of the data, searching Is often better done via a hashing data structure Instead of via a search tree. The speed one observes In practice Is due to the fact that the truncation operation Is a constant time operation.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52454607225105,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52454607946001,"sku":"NLS9780817633288","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817633288.jpg?v=1785930656"},{"product_id":"advances-in-proof-theory-book-reinhard-kahle-9783319291963","title":"Advances in Proof Theory","description":"The aim of this volume is to collect original contributions by the best specialists from the area of proof theory, constructivity, and computation and discuss recent trends and results in these areas.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52485617484049,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52485618762001,"sku":"NLS9783319291963","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783319291963.jpg?v=1786615068"},{"product_id":"advances-in-proof-theory-book-reinhard-kahle-9783319805139","title":"Advances in Proof Theory","description":"The aim of this volume is to collect original contributions by the best specialists from the area of proof theory, constructivity, and computation and discuss recent trends and results in these areas. Some emphasis will be put on ordinal analysis, reductive proof theory, explicit mathematics and type-theoretic formalisms, and abstract computations. The volume is dedicated to the 60th birthday of Professor Gerhard Jäger, who has been instrumental in shaping and promoting logic in Switzerland for the last 25 years. It comprises contributions from the symposium “Advances in Proof Theory”, which was held in Bern in December 2013.\u003cbr\u003e\u003cbr\u003e​Proof theory came into being in the twenties of the last century, when it was inaugurated by David Hilbert in order to secure the foundations of mathematics. It was substantially influenced by Gödel's famous incompleteness theorems of 1930 and Gentzen's new consistency proof for the axiom system of first order number theory in 1936. Today, proof theory is a well-established branch of mathematical and philosophical logic and one of the pillars of the foundations of mathematics. Proof theory explores constructive and computational aspects of mathematical reasoning; it is particularly suitable for dealing with various questions in computer science.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52584199422225,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52584200143121,"sku":"NLS9783319805139","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783319805139.jpg?v=1786791580"},{"product_id":"feasible-mathematics-ii-book-peter-clote-9781461275824","title":"Feasible Mathematics II","description":"Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what comes out - but what fact is this supposed to confirm for me? I don't know 'what is supposed to come out' . . . . 1 -L. Wittgenstein A feasible computation uses small resources on an abstract computa­ tion device, such as a 'lUring machine or boolean circuit. Feasible math­ ematics concerns the study of feasible computations, using combinatorics and logic, as well as the study of feasibly presented mathematical structures such as groups, algebras, and so on. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra, with substantial overlap between different fields. In computational complexity theory, the polynomial time hierarchy is characterized without the introduction of runtime bounds by the closure of certain initial functions under safe composition, predicative recursion on notation, and unbounded minimization (S. Bellantoni); an alternative way of looking at NP problems is introduced which focuses on which pa­ rameters of the problem are the cause of its computational complexity and completeness, density and separation\/collapse results are given for a struc­ ture theory for parametrized problems (R. Downey and M. Fellows); new characterizations of PTIME and LINEAR SPACE are given using predicative recurrence over all finite tiers of certain stratified free algebras (D.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52617595945233,"sku":"NLS9781461275824","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781461275824.jpg?v=1761530775"},{"product_id":"applied-probability-computer-science-the-interface-volume-1-book-rl-disney-9780817631161","title":"Applied Probability-Computer Science: The Interface Volume 1","description":null,"brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52663578427665,"sku":"NLS9780817631161","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52740298178833,"sku":"NIN9780817631161","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780817631161.jpg?v=1785988689"}],"url":"https:\/\/www.worldofbooks.com\/collections\/progress-in-computer-science-and-applied-logic-book-series.oembed?page=2","provider":"World of Books ","version":"1.0","type":"link"}