Boolean function complexity /  
edited by M.S. Paterson. 
 - Cambridge ;  New York, NY, USA :  Cambridge University Press,  1992. 
 - 201 p. :  ill. ;  23 cm. 
 - London Mathematical Society lecture note series ;  169 .
<br/><br/> Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society. 
<br/><br/>Includes bibliographical references (p. 198-201). 
<br/><br/><label>ISBN: </label>0521408261 
<br/><br/><label>LCCN: </label>93111192  
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computational complexity--Congresses.<br/>Algebra, Boolean.
<br/><br/><label>LC Class. No.: </label>QA 267.7  / .B66 1992 
<br/><br/><label>Dewey Class. No.: </label>511.3/24