Boolean function complexity has seen exciting advances in the last few years. It is a long established area of discrete mathematics which uses combinatorial and occasionally algebraic methods. Here 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 working in related areas.
- ISBN:
- 9780521408264
- 9780521408264
- Category:
- Mathematical logic
- Format:
- Paperback
- Publication Date:
- 05-11-1992
- Language:
- English
- Publisher:
- Cambridge University Press
- Country of origin:
- United Kingdom
- Pages:
- 212
- Dimensions (mm):
- 229x152x12mm
- Weight:
- 0.32kg
Click 'Notify Me' to get an email alert when this item becomes available
Great!
Click on Save to My Library / Lists
Click on Save to My Library / Lists
Select the List you'd like to categorise as, or add your own
Here you can mark if you have read this book, reading it or want to read
Awesome! You added your first item into your Library
Great! The fun begins.
Click on My Library / My Lists and I will take you there
Click on My Library / My Lists and I will take you there
Reviews
Be the first to review Boolean Function Complexity.
Share This Book: