Boolean Function Complexity
(Book #169 in the London Mathematical Society Lecture Note Series)
No Customer Reviews
Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The list of participants includes very well known figures in the field, and the topics covered will be significant to many mathematicians and computer scientists...
Format:Paperback
Language:English
ISBN:0521408261
ISBN13:9780521408264
Release Date:November 1992
Publisher:Cambridge University Press
Length:212 Pages
Weight:0.70 lbs.
Dimensions:0.5" x 6.0" x 9.0"
Customer Reviews
0 rating
Copyright © 2024 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
