The average rating for Directions In Mathematical Systems Theory And Optimization based on 2 reviews is 3 stars.
Review # 1 was written on 2016-11-09 00:00:00 Matthew Stowers Introduced a nice formalism for reasoning over vector-space representations. Don't yet fully comprehend the author's entailment-based approach to some of the problems. More exploration needed. |
Review # 2 was written on 2013-06-04 00:00:00 Joseph Yarrow If you read this book as first time in order to understand Computational Complexity, then you're probably not going to like it. You need to read Sipser's textbook before you read this book and make sure that you have a strong background in discrete mathematics (if not, then see Rosen's textbook in Discrete Mathematics). This book is recommended by best people in complexity and algorithms such as Scott Aaronson, Sipser, etc. You need to solve as many exercises as you go. The book has five parts: Part I: Algorithms Part II: Logic Part III: P and NP Part IV: Inside P Part V: Beyond NP The most important parts are in Part I, III. |
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!!