Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 69,99 €.

Provjerite status narudžbe

Pridružite se zajednici ljubitelja knjige iz cijelog svijeta i ostvarite mnoštvo pogodnosti. Izradite besplatni račun

Besplatna dostava Overseas kurirskom službom iznad 69.99 €

DPD kurir 3.99 € DPD točka 3.49 € GLS Kurir 4.99 € GLS paketomat 3.99 € Hrvatska pošta 4.99 € Dostava Overseas 4.99 € Box Now 4.49 €

Kontakt

Kako kupovati

Pomoć

Moj račun

▸ Prazno :-(

Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 69,99 €.

Perspectives in Computational Complexity

Name: Perspectives in Computational Complexity
Brand: Birkhauser
SKU: 13817025
Price: 112.96 EUR
Availability: InStock
Author: Manindra Agrawal
ISBN: 9783319350585

The Somenath Biswas Anniversary Volume

Manindra Agrawal

Vikraman Arvind

Jezik

Engleski

Knjiga Meki uvez

Libristo kod: 13817025

Nakladnici Birkhauser, kolovoz 2016

This book brings together contributions by leading researchers in computational complexity theory wr... Cijeli opis

Libristo kod: 13817025

274 b

112.96 €

Vanjske zalihe Šaljemo za 5-8 dana

Do 30 dana za povrat

Kupci su kupili i

Die Auswirkungen der Europäischen Menschenrechtskonvention auf die deutsche Rechtsprechung Charlotte Währisch

Meki uvez

16.13 €

EL DERECHO DE AUTODETERMINACION DE LOS PUEBLOS EN EL SIGLO XXI MARTINEZ JIMENEZ

Knjiga

32.17 €

PÄÄSTIKPUNKTITERAAPIA KÄSIRAAMAT Kerli Hurt

Meki uvez

58.59 €

PIACERE MANUALE

Knjiga

17.54 €

Ciałko. Hiszpania kradnie swoje dzieci Katarzyna Kobylarczyk

Tvrdi uvez

9.37 €

Loutkář Daniel Cole

Tvrdi uvez

13.00 €

Mikołaj Kopernik (1473-1543). Grochowski Zbigniew

Meki uvez

13.81 €

Valeur En Douane En D bat Oumar Arabov

Meki uvez

86.94 €

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.