Cantitate/Preț
Produs
Total produse
Vezi coșul
Perspectives in Computational Complexity de Manindra Agrawal

Perspectives in Computational Complexity: Progress in Computer Science and Applied Logic, cartea 26

Editat de Manindra Agrawal, Vikraman Arvind
en Limba Engleză Hardback – 31 iul 2014
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 66598 lei  6-8 săpt.
  Springer International Publishing – 23 aug 2016 66598 lei  6-8 săpt.
Hardback (1) 66855 lei  6-8 săpt.
  Palgrave MacMillan – 31 iul 2014 66855 lei  6-8 săpt.

Din seria Progress in Computer Science and Applied Logic

  • 20% Applied Probability-Computer Science: The Interface Volume 1: Sponsored by Applied Probability Technical Section College of the Operations Research Society of America The Institute of Management Sciences January 5–7, 1981 Florida Atlantic University Boca Raton, Florida
    Preț: 32974 lei
  • Graph-Based Proof Procedures for Horn Clauses
    Preț: 36582 lei
  • 20% A Proof Theory for General Unification
    Preț: 31928 lei
  • 24% Logical Methods
    Preț: 90496 lei
  • 15% Variational Calculus, Optimal Control and Applications: International Conference in Honour of L. Bittner and R. Klötzler, Trassenheide, Germany, September 23-27, 1996
    Preț: 56852 lei
  • 20% Feasible Mathematics II
    Preț: 32748 lei
  • 20% Learning and Geometry: Computational Approaches
    Preț: 66159 lei
  • 20% Symbolic Rewriting Techniques
    Preț: 32198 lei
  • 20% Bounded Queries in Recursion Theory
    Preț: 62419 lei
  • Number Theoretic Methods in Cryptography: Complexity lower bounds
    Preț: 37303 lei
  • 20% Interpolating Cubic Splines
    Preț: 56408 lei
  • 20% An Introduction to Quantum Computing Algorithms
    Preț: 45663 lei
  • Applied Probability-Computer Science: The Interface Volume 1
    Preț: 39525 lei
  • Cryptography and Computational Number Theory
    Preț: 37878 lei
  • Automata Theory and its Applications
    Preț: 38843 lei
  • 15% Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness
    Preț: 62180 lei
  • 15% Coding, Cryptography and Combinatorics
    Preț: 62148 lei
  • 20% Mathematical Logic
    Preț: 32572 lei
  • 15% Advances in Proof Theory
    Preț: 62611 lei
  • 18% Temporal Type Theory: A Topos-Theoretic Approach to Systems and Behavior
    Preț: 70191 lei
  • Applied Probability— Computer Science: The Interface
    Preț: 38413 lei
  • 20% Notes on Introductory Combinatorics
    Preț: 48383 lei
  • 20% The Evolution of Programs
    Preț: 32197 lei
  • Lecture Notes on Bucket Algorithms
    Preț: 36545 lei
  • Real-Time Control of Walking
    Preț: 36656 lei
  • 20% Feasible Mathematics
    Preț: 32174 lei

Preț: 66855 lei

Preț vechi: 78653 lei
-15%

Puncte Express: 1003
Preț estimativ în valută:
11824€ • 13664$ • 10205£

Carte tipărită la comandă

Livrare economică 25 aprilie-09 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319054452
ISBN-10: 3319054457
Pagini: 212
Ilustrații: X, 202 p. 8 illus., 1 illus. in color.
Dimensiuni: 160 x 241 x 18 mm
Greutate: 0.49 kg
Ediția:2014
Editura: Palgrave MacMillan
Colecția Progress in Computer Science and Applied Logic
Seria Progress in Computer Science and Applied Logic

Locul publicării:Cham, Switzerland

Public țintă

Graduate

Cuprins

Preface.- 1. Complexity Theory Basics: NP and NL (Vikraman Arvind).- 2. Investigations Concerning the Structure of Complete Sets (Eric Allender).- 3. Space Complexity of the Directed Reachability Problem Over Surface-embedded Graphs (N.V. Vinodchandran).- 4. Algebraic Complexity Classes (Meena Mahajan).- 5. A Selection of Lower Bound Results for Arithmetic Circuits (Neeraj Kayal and Ramprasad Saptharishi).- 6. Explicit Tensors (Markus Bläser).- 7. Progress on Polynomial Identity Testing (Nitin Saxena).- 8. Malod and the Pascaline (Bruno Poizat).- 9. A Tutorial in Time and Space Bounds for Tree-like Resolution (Jacobo Torán).- 10. An Entropy Based Proof for the Moore Bound for Irregular Graphs (S. Ajesh Babu and Jaikumar Radharishnan).- 11. Permutation Groups and the Graph Isomorphism Problem (Sumanta Ghosh and Piyush P. Kurur).

Notă biografică

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.

Textul de pe ultima copertă

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.

Caracteristici

Accessible and self-contained text addressing both graduate students and researchers Two introductory chapters provide basic background material Leads the reader to research level questions in various topics of current interest in computational complexity Includes supplementary material: sn.pub/extras