Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26) - Image 1

£83.15

Birkhauser Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

Name: Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)
Brand: Birkhauser
Price: 83.15 GBP
Availability: InStock

Architecture & Microprocessors

About as cheap as it gets. The only time it was cheaper was 1 year ago.

£83 today · all-time low £80 (May 2025) · usually the usual

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 616 days • 616 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 616 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £83 (388 days, 63.0%)

Price range: £80 - £83

Price levels: 2 different prices over 616 days

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. From the Back Cover 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. About the Author Manindra Agrawal is Professor at the Department of Computer Science and Engineering of the Indian Institute of Technology in Kanpur, India. Vikraman Arvind is Professor at the Institute of Mathematical Sciences of the CIT Campus in Chennai, India.

Product Specifications

Brand: Birkhauser
Format: paperback
ASIN: 3319350587
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 23 August 2016
Listed Since: 10 August 2016

Barcode

No barcode data available

Birkhauser Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

About as cheap as it gets. The only time it was cheaper was 1 year ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

The Mathematics of Paul Erdős II

The Mathematics of Paul Erdős II: 2

Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

From Astrophysics to Unconventional Computation: Essays Presented to Susan Stepney on the Occasion of her 60th Birthday: 35 (Emergence, Complexity and Computation, 35)

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

Mathematics in Computing: An Accessible Guide to Historical, Foundational and Application Contexts (Undergraduate Topics in Computer Science)

Computational Complexity: A Modern Approach

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

Finite and Infinite Combinatorics in Sets and Logic: 411 (Nato Science Series C:, 411)

The Nature of Computation

Art of Computer Programming, The, Volumes 1-4B, Boxed Set: Fundamental Algorithms / Seminumerical Algorithms / Sorting and Searching / Combinatorial ... Part 1 / Combinatorial Algorithms, Part 2

Maths For Computing: A Beginner's Guide (Undergraduate Topics in Computer Science)

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests (Undergraduate Topics in Computer Science)

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability (Iste)

Limits of Computation: An Introduction to the Undecidable and the Intractable

Combinatorial Nullstellensatz: With Applications to Graph Colouring (CRC Focus)

Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

Theoretical and Mathematical Foundations of Computer Science: Second International Conference, ICTMF 2011, Singapore, May 5-6, 2011, Revised Selected ... in Computer and Information Science, 164)

The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)