On the hardness of approximate multivariate integration

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Scopus citations

Abstract

We show that it is NP-hard to 2nk-approximate the integral of a positive, smooth, polynomial-time computable n-variate function, for any fixed integer k.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsSanjeev Asora, Amit Sahai, Klaus Jansen, Jose D.P. Rolim
PublisherSpringer Verlag
Pages122-128
Number of pages7
ISBN (Print)3540407707, 9783540407706
DOIs
StatePublished - 2003
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2764
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the hardness of approximate multivariate integration'. Together they form a unique fingerprint.

Cite this