|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Francis Sullivan, "The Art of Approximation," Computing in Science and Engineering, vol. 12, no. 6, pp. 59-61, November/December, 2010. | |||
| BibTex | x | ||
| @article{ 10.1109/MCSE.2010.139, author = {Francis Sullivan}, title = {The Art of Approximation}, journal ={Computing in Science and Engineering}, volume = {12}, number = {6}, issn = {1521-9615}, year = {2010}, pages = {59-61}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCSE.2010.139}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - Computing in Science and Engineering TI - The Art of Approximation IS - 6 SN - 1521-9615 SP59 EP61 EPD - 59-61 A1 - Francis Sullivan, PY - 2010 KW - Rapid approximation KW - topological sort KW - Monte Carlo VL - 12 JA - Computing in Science and Engineering ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCSE.2010.139
A fine line divides "not bad and useful" from "wildly wrong" when it comes to easy approximations for hard-to-compute problems.
1. G. Brightwell and P. Winkler, "Counting Linear Extensions is #P-Complete," Proc. 23rd ACM Symp. Theory Computing, ACM Press, 1991, pp. 175–181.
Index Terms:
Rapid approximation, topological sort, Monte Carlo
Citation:
Francis Sullivan, "The Art of Approximation," Computing in Science and Engineering, vol. 12, no. 6, pp. 59-61, Nov.-Dec. 2010, doi:10.1109/MCSE.2010.139
Usage of this product signifies your acceptance of the Terms of Use.

