Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Explores boolean functions and computation models in theoretical computer science. Key insights for discrete mathematics readers. Customer note indicates engagement with specialized topics
Highlights
- theory-centered content
- texts in theoretical computer science series
- comprehensive coverage of models
Pros
- focused on theoretical models
- authored by recognized researchers
- suitable for advanced study in discrete math
- clear categorization within theory topics
Cons
- limited customer feedback
- niche subject may limit audience
- no features listed
