Boolean function complexity

Boolean function complexity: advances and frontiers

by Jukna, Stasys

Type Book
Rate 0.0 /5
Details
Files
Reviews
Download

Title Statements

  • Full title :Boolean function complexity : advances and frontiers / Stasys Jukna.

Edition Statements

  • Publication Date:©2012.

Publication Statements

  • Publisher(s):Springer
  • Place of Publication:Berlin
  • Language:eng
  • Publication Date:©2012.

The Physical Object

  • Description:1 online resource (xv, 617 p.).

Edition Identifiers

Table of Contents

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.

Read More ↓

Subjects

Complexité de calcul (Informatique) Computational complexity Information and Communication, Circuits Information theory mathematics Mathematics of Computing Mathématiques Théorie de l'information Theory of Computation

Writers

Jukna, Stasys

More from this Series

  • Graph colouring and the probabilistic method

    c2002.
    more →
    Graph colouring and the probabilistic method

  • Graph colouring and the probabilistic method

    cop. 2002.
    more →
    Graph colouring and the probabilistic method

  • Graph colouring and the probabilistic method

    2002.
    more →
    Graph colouring and the probabilistic method

  • Graph colouring and the probabilistic method

    2002.
    more →
    Graph colouring and the probabilistic method

  • Graph colouring and the probabilistic method

    2002
    more →
    Graph colouring and the probabilistic method

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

No downloadable files are registered for this work yet.

Log in to request a copy