The Resource Boolean function complexity : advances and frontiers, Stasys Jukna
Boolean function complexity : advances and frontiers, Stasys Jukna
Resource Information
The item Boolean function complexity : advances and frontiers, Stasys Jukna represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Boolean function complexity : advances and frontiers, Stasys Jukna represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
- Summary
- 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
- Language
- eng
- Extent
- 1 online resource (xv, 617 pages).
- 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
- Isbn
- 9783642245084
- Label
- Boolean function complexity : advances and frontiers
- Title
- Boolean function complexity
- Title remainder
- advances and frontiers
- Statement of responsibility
- Stasys Jukna
- Language
- eng
- Summary
- 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
- Cataloging source
- GW5XE
- http://library.link/vocab/creatorDate
- 1953-
- http://library.link/vocab/creatorName
- Jukna, Stasys
- Dewey number
- 511.3/52
- Index
- index present
- Language note
- English
- LC call number
- QA267.7
- LC item number
- .J85 2012
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- NLM call number
- Online Book
- Series statement
- Algorithms and combinatorics,
- Series volume
- v. 27
- http://library.link/vocab/subjectName
-
- Computational complexity
- Mathematics
- Information Theory
- Computational complexity
- Label
- Boolean function complexity : advances and frontiers, Stasys Jukna
- Antecedent source
- unknown
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- multicolored
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- 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
- Control code
- 773291557
- Dimensions
- unknown
- Extent
- 1 online resource (xv, 617 pages).
- File format
- unknown
- Form of item
- online
- Isbn
- 9783642245084
- Lccn
- 2011945088
- Level of compression
- unknown
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/978-3-642-24508-4
- Quality assurance targets
- not applicable
- Reformatting quality
- unknown
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)773291557
- Label
- Boolean function complexity : advances and frontiers, Stasys Jukna
- Antecedent source
- unknown
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- multicolored
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- 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
- Control code
- 773291557
- Dimensions
- unknown
- Extent
- 1 online resource (xv, 617 pages).
- File format
- unknown
- Form of item
- online
- Isbn
- 9783642245084
- Lccn
- 2011945088
- Level of compression
- unknown
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/978-3-642-24508-4
- Quality assurance targets
- not applicable
- Reformatting quality
- unknown
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)773291557
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Boolean-function-complexity--advances-and/3nHlxUIaz00/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Boolean-function-complexity--advances-and/3nHlxUIaz00/">Boolean function complexity : advances and frontiers, Stasys Jukna</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Boolean function complexity : advances and frontiers, Stasys Jukna
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Boolean-function-complexity--advances-and/3nHlxUIaz00/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Boolean-function-complexity--advances-and/3nHlxUIaz00/">Boolean function complexity : advances and frontiers, Stasys Jukna</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
