Jerrum, Valiant, and Vazirani showed that every #P-complete problem either has an FPRAS, or is essentially impossible to approximate; if there is any polynomial-time algorithm which consistently produces an approximation of a #P-complete problem which is within a polynomial ratio in the size of the input of the exact answer, then that algorithm can be used to construct an FPRAS.
Mark Twain | Mark | Mark Wahlberg | Mark Knopfler | Mark Zuckerberg | Mark Rothko | Mark Antony | Mark the Evangelist | Gospel of Mark | Mark Ronson | Mark Spitz | Mark Foley | Mark Murphy (singer) | Mark Murphy | Mark McGwire | Mark Hamill | Deutsche Mark | Mark Taper Forum | Mark Millar | Mark Lewisohn | Mark Kermode | Mark Lanegan | Mark Waugh | Mark Rydell | Mark Goodson | Mark Owen | Mark Mothersbaugh | Mark Medoff | Mark Heard | Mark Dayton |