//]]>

Boolean Function Complexity (Record no. 23844)

000 -LEADER
fixed length control field 02484nam a22004695i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310151457.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 120104s2012 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642245084
978-3-642-24508-4
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number Q350-390
Classification number QA10.4
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 519
Edition number 23
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2012.
912 ## -
-- ZDB-2-SMA
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Jukna, Stasys.
Relator term author.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Boolean Function Complexity
Medium [electronic resource] :
Remainder of title Advances and Frontiers /
Statement of responsibility, etc by Stasys Jukna.
300 ## - PHYSICAL DESCRIPTION
Extent XVI, 620 p.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Algorithms and Combinatorics,
International Standard Serial Number 0937-5511 ;
Volume number/sequential designation 27
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics.
Topical term or geographic name as entry element Information theory.
Topical term or geographic name as entry element Computer science.
Topical term or geographic name as entry element Combinatorics.
Topical term or geographic name as entry element Mathematics.
Topical term or geographic name as entry element Information and Communication, Circuits.
Topical term or geographic name as entry element Theory of Computation.
Topical term or geographic name as entry element Combinatorics.
Topical term or geographic name as entry element Mathematics of Computing.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642245077
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-24508-4
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-04-10AUM Main Library2014-04-10 2014-04-10 E-Book   AUM Main Library519
Languages: 
English |
العربية