Rocco a servedio (31 resultados)

Paperback. Condición: Wie neu. XI, 402 S.; with figures, 24 cm, Like new. Shrink wrapped. / Wie neu. In Folie verschweißt. Sprache: Englisch Gewicht in Gramm: 710.

Paperback. Condición: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding.

Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condición: Used. pp. 422.

Condición: Used. pp. 422 Illus.

Condición: Used. pp. 422.

Condición: New. In English.

PF. Condición: New.

Paperback. Condición: New. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture. In 2010, Valiant received the ACM's Turing Award for "transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing." His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards. Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper "A Theory of the Learnable," which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental "counting complexity" class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a "bridging" model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential.…

HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condición: Brand New. 1st edition. 402 pages. 9.00x6.00x1.00 inches. In Stock.

Condición: New.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the papers presented at the 18th International Conf- ence on Algorithmic Learning Theory (ALT 2007), which was held in Sendai (Japan) during October 1-4, 2007. The main objective of the conference was to provide an interdisciplinary forum for high-quality talks with a strong theore- cal background and scienti c interchange in areas such as query models, on-line learning, inductive inference, algorithmic forecasting, boosting, support vector machines, kernel methods, complexity and learning, reinforcement learning, - supervised learning and grammatical inference. The conference was co-located with the Tenth International Conference on Discovery Science (DS 2007). This volume includes 25 technical contributions that were selected from 50 submissions by the ProgramCommittee. It also contains descriptions of the ve invited talks of ALT and DS; longer versions of the DS papers are available in the proceedings of DS 2007. These invited talks were presented to the audience of both conferences in joint sessions.…

Hardback. Condición: New. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture. In 2010, Valiant received the ACM's Turing Award for "transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing." His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards. Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper "A Theory of the Learnable," which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental "counting complexity" class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a "bridging" model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential.…

Paperback. Condición: New. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture. In 2010, Valiant received the ACM's Turing Award for "transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing." His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards. Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper "A Theory of the Learnable," which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental "counting complexity" class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a "bridging" model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential.…

Hardback. Condición: New. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture. In 2010, Valiant received the ACM's Turing Award for "transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing." His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards. Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper "A Theory of the Learnable," which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental "counting complexity" class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a "bridging" model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential.…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 18th International Conference on Algorithmic Learning Theory, ALT 2007, held in Sendai, Japan, October 1-4, 2007, co-located with the 10th International Conference on Discovery Science, DS 2007. The 25 revised full papers presented together with the abstracts of five invited papers were carefully reviewed and selected from 50 submissions. They are dedicated to the theoretical foundations of machine learning. 420 pp. Englisch.…

Paperback. Condición: new. Paperback. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture. In 2010, Valiant received the ACM's Turing Award for "transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing." His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards. Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper "A Theory of the Learnable," which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental "counting complexity" class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a "bridging" model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, providing modern perspectives on these landmark papers. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Hardcover. Condición: new. Hardcover. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture. In 2010, Valiant received the ACM's Turing Award for "transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing." His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards. Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper "A Theory of the Learnable," which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental "counting complexity" class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a "bridging" model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential. Celebrating visionary scientific achievements, this volume compiles eight influential research works enriched by expert perspectives. It highlights seminal advances in computational learning theory, complexity theory, and parallel computing, featuring landmark papers, a biography, an interview, and a Turing Award lecture. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book constitutes the refereed proceedings of the 18th International Conference on Algorithmic Learning Theory, ALT 2007, held in Sendai, Japan, October 1-4, 2007, co-located with the 10th International Conference on Discovery Science, DS 2007. The 2.…

Paperback. Condición: new. Paperback. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture. In 2010, Valiant received the ACM's Turing Award for "transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing." His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards. Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper "A Theory of the Learnable," which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental "counting complexity" class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a "bridging" model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, providing modern perspectives on these landmark papers. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This volume contains the papers presented at the 18th International Conf- ence on Algorithmic Learning Theory (ALT 2007), which was held in Sendai (Japan) during October 1¿4, 2007. The main objective of the conference was to provide an interdisciplinary forum for high-quality talks with a strong theore- cal background and scienti c interchange in areas such as query models, on-line learning, inductive inference, algorithmic forecasting, boosting, support vector machines, kernel methods, complexity and learning, reinforcement learning, - supervised learning and grammatical inference. The conference was co-located with the Tenth International Conference on Discovery Science (DS 2007). This volume includes 25 technical contributions that were selected from 50 submissions by the ProgramCommittee. It also contains descriptions of the ve invited talks of ALT and DS; longer versions of the DS papers are available in the proceedings of DS 2007. These invited talks were presented to the audience of both conferences in joint sessions.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 420 pp. Englisch.…

Hardcover. Condición: new. Hardcover. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture. In 2010, Valiant received the ACM's Turing Award for "transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing." His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards. Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper "A Theory of the Learnable," which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental "counting complexity" class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a "bridging" model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential. Celebrating visionary scientific achievements, this volume compiles eight influential research works enriched by expert perspectives. It highlights seminal advances in computational learning theory, complexity theory, and parallel computing, featuring landmark papers, a biography, an interview, and a Turing Award lecture. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Hardcover. Condición: new. Hardcover. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture. In 2010, Valiant received the ACM's Turing Award for "transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing." His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards. Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper "A Theory of the Learnable," which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental "counting complexity" class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a "bridging" model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential. Celebrating visionary scientific achievements, this volume compiles eight influential research works enriched by expert perspectives. It highlights seminal advances in computational learning theory, complexity theory, and parallel computing, featuring landmark papers, a biography, an interview, and a Turing Award lecture. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture.In 2010, Valiant received the ACM's Turing Award for 'transformative contributions to the theory of computation, including the theory of Probably Approximately Correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing.' His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards.Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper 'A Theory of the Learnable,' which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental 'counting complexity' class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a 'bridging' model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential.…

Buch. Condición: Neu. Foundations of Computation and Machine Learning | The Work of Leslie Valiant | Rocco Anthony Servedio | Buch | ACM Books | Einband - fest (Hardcover) | Englisch | 2026 | Association for Computing Machinery | EAN 9798400731716 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. …

Buch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture.In 2010, Valiant received the ACM's Turing Award for 'transformative contributions to the theory of computation, including the theory of Probably Approximately Correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing.' His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards.Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper 'A Theory of the Learnable,' which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental 'counting complexity' class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a 'bridging' model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential.…

Paperback. Condición: new. Paperback. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, along with accompanying contributions providing modern perspectives on these landmark papers in the context of contemporary research in complexity theory, parallel computing, computational learning theory, and machine learning. It also contains a biography of Leslie Valiant, an interview with him, and his Turing Award lecture. In 2010, Valiant received the ACM's Turing Award for "transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing." His research contributions have also been recognized with the International Mathematical Union's Nevanlinna Prize in 1986, the Knuth Prize in 1997, and many other awards. Leslie Valiant has made deep contributions to an unusually broad range of areas within theoretical computer science. Perhaps his most celebrated contribution has been his paper "A Theory of the Learnable," which gave birth to the field of computational learning theory and provided much of the intellectual foundation for the highly successful development of modern machine learning. His pioneering research in computational complexity inaugurated the study of the complexity of counting problems, defining the fundamental "counting complexity" class #P and showing that a wide range of natural counting problems are complete for this class. Valiant defined algebraic analogues of the complexity classes P and NP and established the first completeness results for these classes; this groundbreaking work opened new vistas for the field of algebraic complexity theory that continue to be explored to this day. Valiant also made seminal contributions to the field of parallel computing through his development of the highly impactful Bulk Synchronous Parallel (BSP) model as a "bridging" model between parallel software and parallel hardware, and he gave an unexpected randomized message-routing algorithm for parallel computers, which has been highly influential. This volume is a celebration of Leslie Valiant's scientific and intellectual achievements. It contains eight of Valiant's most impactful research works, providing modern perspectives on these landmark papers. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…