Back to Results
First PageMeta Content
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


On the hardness of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA
Add to Reading List

Document Date: 2011-03-02 23:57:00

Open Document

File Size: 136,10 KB

Share Result on Facebook

Company

HP / /

/

Facility

Ioannis Koutis Computer Science Department Carnegie Mellon University / /

IndustryTerm

black-box algorithm / faster algorithms / approximation algorithm / /

Organization

Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh / /

Person

Uri Zwick / Christos Papadimitriou / Leslie Ann Goldberg / Alan Frieze / Graham Brightwell / Catherine Greenhill / Martin Dyer / Peter Winkler / Mark Jerrum / Ravi Kannan / Raphael Yuster / David Applegate / Ioannis Koutis / /

/

ProgrammingLanguage

C / /

PublishedMedium

Journal of the ACM / Theoretical Computer Science / Theory of Computing / /

Technology

black-box algorithm / approximation algorithm / 2 randomized algorithm / integration algorithm / /

SocialTag