ABSTRACT
Many combinatorial search problems can be reduced to solving a matrix equation of the form () A U = B https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003068006/5c47264a-ff57-47f6-a54b-c0290702d6af/content/eq2564.tif"/>
