Vikraman Arvind (24 results)

Condition: New. Editor(s): Agrawal, Manindra; Arvind, Vikraman. Series: Progress in Computer Science and Applied Logic. Num Pages: 212 pages, 7 black & white illustrations, 1 colour illustrations, biography. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 11. Weight in Grams: 332. . 2016. Softcover reprint of the original 1st ed. 2014. Paperback. . . . .…

Condition: New.

Gebunden. Condition: New.

Condition: New. Perspectives in Computational Complexity Editor(s): Agrawal, Manindra; Arvind, Vikraman. Series: Progress in Computer Science and Applied Logic. Num Pages: 212 pages, 7 black & white illustrations, 1 colour illustrations, biography. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 13. Weight in Grams: 485. . 2014. Hardback. . . . . …

Condition: New. pp. 212 Softcover reprint of the original 1st ed. 2014 edition NO-PA16APR2015-KAP.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Condition: New. pp. 214.

Hardcover. Condition: Brand New. anv edition. 202 pages. 9.75x6.75x0.75 inches. In Stock.

Condition: New. Editor(s): Agrawal, Manindra; Arvind, Vikraman. Series: Progress in Computer Science and Applied Logic. Num Pages: 212 pages, 7 black & white illustrations, 1 colour illustrations, biography. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 11. Weight in Grams: 332. . 2016. Softcover reprint of the original 1st ed. 2014. Paperback. . . . . Books ship from the US and Ireland.…

Condition: New. Perspectives in Computational Complexity Editor(s): Agrawal, Manindra; Arvind, Vikraman. Series: Progress in Computer Science and Applied Logic. Num Pages: 212 pages, 7 black & white illustrations, 1 colour illustrations, biography. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 13. Weight in Grams: 485. . 2014. Hardback. . . . . Books ship from the US and Ireland. …

Paperback. Condition: Brand New. reprint edition. 212 pages. 9.25x6.10x0.50 inches. In Stock.

Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: new. Questo è un articolo print on demand.

Condition: new. Questo è un articolo print on demand.

PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 212 pp. Englisch.…

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 212 pp. Englisch.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 212 pp. Englisch.…

Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 212 pp. Englisch.…

Condition: New. Print on Demand pp. 212.

Condition: New. Print on Demand pp. 214 8 Illus. (1 Col.).

Condition: New. PRINT ON DEMAND pp. 212.

Condition: New. PRINT ON DEMAND pp. 214.