Progress in Computer Science and Applied Logic – serie
Visar alla böcker i serien Progress in Computer Science and Applied Logic. Handla med fri frakt och snabb leverans.
39 produkter
Applied Probability-Computer Science: The Interface Volume 1
Av Ralph L. Disney, Teunis J. Ott
Inbunden, 1982
545 kr
Lägg i varukorg
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 …
Applied Probability— Computer Science: The Interface
Av Ralph L. Disney, Teunis J. Ott
Häftad, 1982
545 kr
Lägg i varukorg
Applied Probability-Computer Science: The Interface Volume 1
Sponsored by Applied Probability Technical Section College of the Operations Research Society of America The Institute of Management Sciences January 5–7, 1981 Florida Atlantic University Boca Raton, Florida
Av R.L. Disney, T.J. Ott
Häftad, 1983
552 kr
Lägg i varukorg
Notes on Introductory Combinatorics
Av George Polya, Robert E. Tarjan m. fl.
Häftad, 1990
877 kr
Lägg i varukorg
In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who ·was over …
Evolution of Programs
Av DERSHOWITZ
Häftad, 1983
552 kr
Lägg i varukorg
-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 …
Lecture Notes on Bucket Algorithms
Av DEVROYE
Häftad, 1985
545 kr
Lägg i varukorg
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 …
Real-Time Control of Walking
Av M.D. Donner
Häftad, 1986
545 kr
Lägg i varukorg
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 …
Feasible Mathematics
A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989
Av S.R. Buss, P.J. Scott
Häftad, 1990
552 kr
Lägg i varukorg
A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "feasible" algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible …
Graph-Based Proof Procedures for Horn Clauses
Av RAATZ
Häftad, 1990
545 kr
Lägg i varukorg
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 …
Proof Theory for General Unification
Av W. Snyder
Inbunden, 1991
567 kr
Lägg i varukorg
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 …
Logical Methods
In Honor of Anil Nerode’s Sixtieth Birthday
Av Crossley, John N. Crossley m. fl.
Inbunden, 1994
1638 kr
Lägg i varukorg
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 …
Learning and Geometry: Computational Approaches
Inbunden, 1995
1094 kr
Lägg i varukorg
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 …
Bounded Queries in Recursion Theory
Av William Levine, Georgia Martin
Inbunden, 1998
1094 kr
Lägg i varukorg
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 …
Introduction to Quantum Computing Algorithms
Inbunden, 1999
769 kr
Lägg i varukorg
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 …
Automata Theory and its Applications
Av Bakhadyr Khoussainov, Anil Nerode
Inbunden, 2001
552 kr
Lägg i varukorg
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 …
Graph-Theoretic Approach to Enterprise Network Dynamics
Av Horst Bunke, Peter J. Dickinson m. fl.
Inbunden, 2006
1129 kr
Lägg i varukorg
Networks have become nearly ubiquitous and increasingly complex, and their support of modern enterprise environments has become fundamental. Accordingly, robust network management techniques are essential to ensure optimal performance of these networks. This monograph treats the application of …
Applied Probability-Computer Science: The Interface Volume 1
Av Ralph L. Disney, Teunis J. Ott
Häftad, 2011
552 kr
Lägg i varukorg
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 …
Automata Theory and its Applications
Av Bakhadyr Khoussainov, Anil Nerode
Häftad, 2012
552 kr
Lägg i varukorg
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 …
Logical Methods
In Honor of Anil Nerode’s Sixtieth Birthday
Av John N. Crossley, Jeffrey B. Remmel m. fl.
Häftad, 2013
1641 kr
Lägg i varukorg
The twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth birthday (4 June 1992) at the Mathematical Sciences Institute, Cornell University, 1-3 June 1992. Some of the conference …
Proof Theory for General Unification
Av W. Snyder
Häftad, 2012
552 kr
Lägg i varukorg
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 …
Bounded Queries in Recursion Theory
Av William Levine, Georgia Martin
Häftad, 2013
1096 kr
Lägg i varukorg
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 …
Interpolating Cubic Splines
Häftad, 2012
748 kr
Lägg i varukorg
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 …
Introduction to Quantum Computing Algorithms
Häftad, 2012
769 kr
Lägg i varukorg
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 …
Feasible Mathematics II
Av Peter Clote, Jeffrey B. Remmel
Häftad, 2011
568 kr
Lägg i varukorg
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 …
Learning and Geometry: Computational Approaches
Häftad, 2011
1096 kr
Lägg i varukorg
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 …
Temporal Type Theory
A Topos-Theoretic Approach to Systems and Behavior
Av Patrick Schultz, David I. Spivak
Inbunden, 2019
813 kr
Lägg i varukorg
This innovative monograph explores a new mathematical formalism in higher-order temporal logic for proving properties about the behavior of systems. Developed by the authors, the goal of this novel approach is to explain what occurs when multiple, distinct system components interact by using a …
Mathematical Logic
Foundations for Information Science
Av Wei Li
Inbunden, 2014
551 kr
Lägg i varukorg
Mathematical 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 …
Cryptographic Applications of Analytic Number Theory
Complexity Lower Bounds and Pseudorandomness
Häftad, 2013
1096 kr
Lägg i varukorg
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 …
Cryptography and Computational Number Theory
Av Kwok Y. Lam, Igor Shparlinski m. fl.
Häftad, 2012
552 kr
Lägg i varukorg
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 workshop was organized by the Centre for Systems Security of the Na tional University of Singapore. …
Coding, Cryptography and Combinatorics
Av Keqin Feng, Harald Niederreiter m. fl.
Häftad, 2012
1096 kr
Lägg i varukorg
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 …
