Boolean function complexity edited by M.S. Paterson

Contributor(s):

Paterson, Michael S

Publication details: Cambridge Cambridge University Press 1992Description: 201 p. : ill. ; 23 cmISBN:

521408261

ISSN:

93111192

Subject(s):

DDC classification:

511.324 PAT

Item type: Books

Tags from this library: No tags from this library for this title.

Average rating: 0.0 (0 votes)

Holdings
Current library	Call number	Status	Date due	Barcode
Anna Centenary Library	511.324 PAT (Browse shelf(Opens below))	Available		234430

Browsing Anna Centenary Library shelves Close shelf browser (Hides shelf browser)

Previous				No cover image available				Next
Previous	511.324 GRE Ones and zeros : understanding Boolean algebra, digital circuits, and the logic of sets	511.324 MAD Relation algebras	511.324 MAD Relation algebras	511.324 PAT Boolean function complexity	511.324 URS Logic and algebra	511.324 VLA Boolean algebras in analysis	511.324 WHI Boolean algebra and its applications	Next

Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society. Includes bibliographical references (p. 198-201)

There are no comments on this title.

to post a comment.

Boolean function complexity edited by M.S. Paterson

Browsing Anna Centenary Library shelves Close shelf browser (Hides shelf browser)

Find us on the map