MathSciNet bibliographic data

MR905473 (89b:03066) 03D15 (06E30 68Q15 94C10) Wegener, Ingo The complexity of Boolean functions. Wiley-Teubner Series in Computer Science. John Wiley & Sons, Ltd., Chichester; B. G. Teubner, Stuttgart, 1987. xii+457 pp. ISBN: 0-471-91555-6

Links to the journal or article are not yet available

For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page American Mathematical Society 201 Charles Street Providence, RI 02904-6248 USA © Copyright 2009, American Mathematical Society Privacy Statement