Title Boolean function complexity / edited by M.S. Paterson.

Publication Info.

Online access
Online eBook. Access restricted to current Rider University students, faculty, and staff.
Instructions for reading/downloading this eBook

Item Status

Description	1 online resource (201 pages) : illustrations.
Physical Medium	polychrome
Description	text file
Series	London Mathematical Society lecture note series ; 169
	London Mathematical Society lecture note series ; 169.
Note	Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society.
Bibliography	Includes bibliographical references (pages 198-201).
Local Note	eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America
Subject	Computational complexity -- Congresses.
	Computational complexity.
	Algebra, Boolean.
	Algebra, Boolean.
Genre/Form	Electronic books.
	Conference papers and proceedings.
	Conference papers and proceedings.
Added Author	Paterson, Michael S.
Other Form:	Print version: Boolean function complexity. Cambridge ; New York, NY, USA : Cambridge University Press, 1992 0521408261 (DLC) 93111192 (OCoLC)28063747
ISBN	9781107361720 (electronic book)
	1107361729 (electronic book)
	9780511526633 (ebook)
	0511526636 (ebook)
	0521408261
	9780521408264