National Science Library of Georgia

Boolean function complexity / (Record no. 517422)

MARC details
000 -LEADER
fixed length control field 02045nam a22003498i 4500
001 - CONTROL NUMBER
control field CR9780511526633
003 - CONTROL NUMBER IDENTIFIER
control field UkCbUP
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200124160229.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION
fixed length control field m|||||o||d||||||||
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr||||||||||||
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 090407s1992||||enk o ||1 0|eng|d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780511526633 (ebook)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Cancelled/invalid ISBN 9780521408264 (paperback)
040 ## - CATALOGING SOURCE
Original cataloging agency UkCbUP
Language of cataloging eng
Description conventions rda
Transcribing agency UkCbUP
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA267.7
Item number .B66 1992
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511.3/24
Edition number 20
245 00 - TITLE STATEMENT
Title Boolean function complexity /
Statement of responsibility, etc edited by M.S. Paterson.
264 #1 - Production, Publication, Distribution, Manufacture, and Copyright Notice (R)
Place of production, publication, distribution, manufacture (R) Cambridge :
Name of producer, publisher, distributor, manufacturer (R) Cambridge University Press,
Date of production, publication, distribution, manufacture, or copyright notice 1992.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (201 pages) :
Other physical details digital, PDF file(s).
336 ## - Content Type (R)
Content type term (R) text
Content type code (R) txt
Source (NR) rdacontent
337 ## - Media Type (R)
Media type term (R) computer
Media type code (R) c
Source (NR) rdamedia
338 ## - Carrier Type (R)
Carrier type term (R) online resource
Carrier type code (R) cr
Source (NR) rdacarrier
490 1# - SERIES STATEMENT
სერიის ცნობა London Mathematical Society lecture note series ;
Volume number/sequential designation 169
500 ## - GENERAL NOTE
General note Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520 ## - SUMMARY, ETC.
Summary, etc By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational complexity
Form subdivision Congresses.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algebra, Boolean.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Paterson, Michael S.,
Relator term editor.
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Print version:
International Standard Book Number 9780521408264
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title London Mathematical Society lecture note series ;
Volume number/sequential designation 169.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1017/CBO9780511526633">https://doi.org/10.1017/CBO9780511526633</a>

No items available.

Copyright © 2023 Sciencelib.ge All rights reserved.