Summary and Opinion Questions on basic algorithms tended to have good answers and good commentary on practical concerns. Questions on basic notions in complexity theory tended to have good answers and some more advanced theorems were stated without proof (usually wisely). Theoretical questions that do not have a practical angle were usually not answered. There is nothing on semantics or logic; however, since the book's title is Algorithms and Theory of Computation Handbook it is not claiming to cover those areas. Many of the chapters have a practical bias and the very choice of topics shows a bias towards practice (e.g., a chapter on graph-drawing algorithms, and seven chapters on cryptography and its variants, while only six chapters on complexity theory). Given the intended audience, this is might be appropriate. The book to compare this to is The Handbook of Theoretical Computer Science, edited by J an Van Leeuwen, MIT press, published in 1990, (paperback available in 1994). Volume A is on ALGORITHMS AND C O M P L E X I T Y and Volume B is on FORMAL MODELS AND SEMANTICS. I will refer to the old handbook as MIT and the new one as CRC.
/lp/association-for-computing-machinery/review-of-handbook-of-combinatorics-in-two-volumes-edited-by-r-l-7FdcB2dPWc