National Science Library of Georgia

Communication complexity / (Record no. 522169)

MARC details
000 -LEADER
fixed length control field 02161nam a22003618i 4500
001 - CONTROL NUMBER
control field CR9780511574948
003 - CONTROL NUMBER IDENTIFIER
control field UkCbUP
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200124160325.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 090522s1997||||enk o ||1 0|eng|d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780511574948 (ebook)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Cancelled/invalid ISBN 9780521560672 (hardback)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Cancelled/invalid ISBN 9780521029834 (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 QA10.3
Item number .K86 1997
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.6/01/5113
Edition number 20
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Kushilevitz, Eyal,
Relator term author.
245 10 - TITLE STATEMENT
Title Communication complexity /
Statement of responsibility, etc Eyal Kushilevitz, Noam Nisan.
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 1997.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (xiii, 189 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
500 ## - GENERAL NOTE
General note Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520 ## - SUMMARY, ETC.
Summary, etc Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algebra, Boolean.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Logic circuits.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational complexity.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Nisan, Noam,
Relator term author.
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Print version:
International Standard Book Number 9780521560672
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1017/CBO9780511574948">https://doi.org/10.1017/CBO9780511574948</a>

No items available.

Copyright © 2023 Sciencelib.ge All rights reserved.