![Analysis of algorithms / Time complexity / Polynomials / NP / Tutte polynomial / Factorization of polynomials over a finite field and irreducibility tests / Theoretical computer science / Mathematics / Computational complexity theory Analysis of algorithms / Time complexity / Polynomials / NP / Tutte polynomial / Factorization of polynomials over a finite field and irreducibility tests / Theoretical computer science / Mathematics / Computational complexity theory](https://www.pdfsearch.io/img/4656ab9a7e338b57f774e8a82748ee20.jpg) Date: 2011-03-02 23:57:00Analysis of algorithms Time complexity Polynomials NP Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Mathematics Computational complexity theory | | On the hardness of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading ListSource URL: ccom.uprrp.eduDownload Document from Source Website File Size: 136,10 KBShare Document on Facebook
|