Transcription of Algorithms and Complexity - Penn Math
{{id}} {{{paragraph}}}
Algorithms and ComplexityHerbert S. WilfUniversity of PennsylvaniaPhiladelphia, PA 19104-6395 Copyright NoticeCopyright 1994 by Herbert S. Wilf. This material may be reproduced for any educational purpose, multiplecopies may be made for classes, etc. Charges, if any, for reproduced copies must be just enough to recoverreasonable costs of reproduction. Reproduction for commercial purposes is prohibited. This cover page mustbe included in all distributed Edition, Summer, 1994 This edition of Algorithms and Complexity is available at the web site<http:// wilf>.
Matrix inversion is easy. The familiar Gaussian elimination method can invert an n×nmatrix in time at most cn3. To give an example of a hard computational problem we have to go far afield. One interesting one is called the ‘tiling problem.’ Suppose* we are given infinitely many identical floor tiles, each shaped like a regular hexagon.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}