Cantitate/Preț
Produs
Total produse
Vezi coșul
Boolean Function Complexity: Advances and Frontiers de Stasys Jukna

Boolean Function Complexity: Advances and Frontiers: Algorithms and Combinatorics, cartea 27

Autor Stasys Jukna
en Limba Engleză Paperback – 22 feb 2014
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive  description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 50019 lei  38-44 zile
  Springer Berlin, Heidelberg – 22 feb 2014 50019 lei  38-44 zile
Hardback (1) 67236 lei  38-44 zile
  Springer Berlin, Heidelberg – 6 ian 2012 67236 lei  38-44 zile

Din seria Algorithms and Combinatorics

  • 18% Matrices and Matroids for Systems Analysis
    Preț: 106420 lei
  • The Simplex Method: A Probabilistic Analysis
    Preț: 36705 lei
  • New Trends in Discrete and Computational Geometry
    Preț: 37108 lei
  • 15% Discrete Images, Objects, and Functions in Zn
    Preț: 60537 lei
  • 15% Linear Optimization and Extensions
    Preț: 62349 lei
  • 18% Geometry of Cuts and Metrics
    Preț: 91429 lei
  • 15% Probabilistic Methods for Algorithmic Discrete Mathematics
    Preț: 61496 lei
  • 18% Modern Cryptography, Probabilistic Proofs and Pseudorandomness
    Preț: 73974 lei
  • 18% Geometric Discrepancy: An Illustrated Guide
    Preț: 90068 lei
  • 18% Applied Finite Group Actions
    Preț: 90293 lei
  • 18% Geometric Algorithms and Combinatorial Optimization
    Preț: 85016 lei
  • Combinatorial Optimization: Theory and Algorithms
    Preț: 48526 lei
  • 15% The Strange Logic of Random Graphs
    Preț: 60520 lei
  • 18% Graph Colouring and the Probabilistic Method
    Preț: 85016 lei
  • 24% Combinatorial Optimization: Polyhedra and Efficiency
    Preț: 80589 lei
  • 18% Discrete and Computational Geometry: The Goodman-Pollack Festschrift
    Preț: 92790 lei
  • 18% Topics in Discrete Mathematics: Dedicated to Jarik Nešetril on the Occasion of his 60th birthday
    Preț: 91606 lei
  • 15% Sparsity: Graphs, Structures, and Algorithms
    Preț: 56182 lei
  • Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications
    Preț: 37855 lei
  • 15% Systems Analysis by Graphs and Matroids: Structural Solvability and Controllability
    Preț: 61019 lei
  • 18% Combinatorics and Complexity of Partition Functions
    Preț: 92098 lei
  • Greedoids
    Preț: 36578 lei
  • 15% Greedoids
    Preț: 55810 lei
  • 15% Mathematics of Ramsey Theory
    Preț: 60861 lei
  • 15% Matroid Theory and its Applications in Electric Network Theory and in Statics
    Preț: 62180 lei
  • Irregularities of Partitions
    Preț: 36144 lei

Preț: 50019 lei

Preț vechi: 62523 lei
-20% Nou

Puncte Express: 750
Preț estimativ în valută:
9579€ • 10366$ • 7985£

Carte tipărită la comandă

Livrare economică 05-11 decembrie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642431449
ISBN-10: 3642431445
Pagini: 636
Ilustrații: XVI, 620 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.86 kg
Ediția:2012
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Graduate

Cuprins

Part I Basics.- Part II Communication Complexity.- Part III Circuit Complexity.- Part IV Bounded Depth Circuits.- Part V Branching Programs.- Part VI Fragments of Proof Complexity.- A Epilog.- B Mathematical Background.- References.- Index.

Recenzii

“All material in the book is accessible to graduate or even undergraduate students of computer science, mathematics or electrical engineering. … I gladly recommend this book to beginning students, who will find this book a good starting point in exploring the field of complexity theory, as well as to mature researchers who would like to bring themselves up-to-date on some aspect of the theory. … the book contains a large number of open research problems, including some really enticing ones!” (Sergey Yekhanin, SIAM Review, Vol. 57 (3), September, 2015)
“The results stated in the book are well motivated and given with an intuitive explanationof their proof idea wherever appropriate. … Each chapter of the book contains open research problems and a section with exercises to deepen the understanding of the presented material and make the book suitable for course work. The book is well suited for graduate students and professionals who seek an accessible, research-oriented guide to the important techniques for proving lower bounds on the complexity of problems connected to Boolean functions.” (Michael Thomas, Mathematical Reviews, January, 2013)

“Jukna, a well-known researcher in the field, has succeeded in producing an excellent comprehensive exposition on the field, starting from early results from the '40s and '50s and proceeding to the most recent achievements. … The book is going to be very useful for researchers and graduate students in computer science and discrete mathematics. … The style of writing is pleasant … . The many exercises and research problems round out the highlights of this recommendable book.” (Arto Salomaa, ACM Computing Reviews, June, 2012)

“This monograph is about circuit complexity, dealing with establishing lower bounds on the computational complexity of specific problems … . The book is mainly devoted to mathematicians, to researchers in computer science wishing to complete their knowledge about the state of the art in circuit complexity, as well as to graduate students in mathematics and computer science, and is self-contained. … An impressive work providing a large amount of information on circuit complexity.” (Ioan Tomescu, Zentralblatt MATH, Vol. 1235, 2012)

Notă biografică

http://www.thi.informatik.uni-frankfurt.de/~jukna/

Textul de pe ultima copertă

Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive  description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.

Caracteristici

This is the first book covering the happening in circuit complexity during the last 20 years Includes non-standard topics, like graph complexity or circuits with arbitrary gates Includes about 40 open problems as potential research topics for students ? Includes supplementary material: sn.pub/extras