This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Art of Approximation
November/December 2010 (vol. 12 no. 6)
pp. 59-61

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.