Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Synopsis
Presents sign-solvability and its applications as a coherent whole; includes many new results.
Booknews
A unified and self-contained presentation of sign-solvability, revealing it as a beautiful interplay among combinatorics (especially graph theory), linear algebra, and theoretical computer science (combinatorial algorithms). The organization of the material affords new connections among various results in the literature, as well as giving new results and new and simpler proofs of previously established results. A noteworthy feature is the explicit description of algorithms that are implicit in many of the proofs, with commentary on their complexity. There are chapter bibliographies as well as a master bibliography. Primarily for researchers in combinatorics and linear algebra, but also of interest to theoretical computer scientists, economists, physicists, chemists, and engineers. Annotation c. Book News, Inc., Portland, OR (booknews.com)