Boolean Function Complexity
Boolean Function Complexity
by London Mathematical Society., M. S. Paterson, Symposium On Boolean Function Complexity
- Title
- Boolean Function Complexity
- ISBN-10
- 1-107-36663-1
- ISBN-13
- 978-1-107-36663-3
- Publisher
- Cambridge ; New York, NY, USA: Cambridge University Press
- Published
- 1992
- Format
Metadata
- EAN
- 9781107366633
- ASIN
- 1107366631
- Prefix
- 978
- Group
- 1
- Group Name
- English language
- Group Identifier
- 978-1
- Registrant
- 107
- Publication
- 36663
- Check Digit
- 3
- Formatted
- 978-1-107-36663-3