£83.15

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

Price data last checked 69 day(s) ago - refreshing...

View at Amazon

Price History & Forecast

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

Historical
Generating forecast...
£83.15 £78.99 £80.66 £82.32 £83.98 £85.64 £87.31 25 January 2026 30 January 2026 04 February 2026 09 February 2026 15 February 2026

Price Distribution

Price distribution over 22 days • 1 price levels

Days at Price
22 days 0 6 11 17 22 £83 Days at Price

Price Analysis

Most common price: £83 (22 days, 100.0%)

Price range: £83 - £83

Price levels: 1 different prices over 22 days

Description

Product 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

Format
paperback
Domain
Amazon UK
Release Date
23 August 2016
Listed Since
10 August 2016

Barcode

No barcode data available