Hardness of Discrepancy Computation and ε-Net Verification in High Dimension

Giannopoulos, Panos; Knauer, Christian; Wahlström, Magnus; Werner, Daniel

doi:10.1016/j.jco.2011.09.001

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Hardness of Discrepancy Computation and ε-Net Verification in High Dimension

MPS-Authors

/persons/resource/persons45687

Wahlström, Magnus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Giannopoulos, P., Knauer, C., Wahlström, M., & Werner, D. (2012). Hardness of Discrepancy Computation and ε-Net Verification in High Dimension. Journal of Complexity, 28(2), 162-176. doi:10.1016/j.jco.2011.09.001.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-C4A5-2

Abstract

There is no abstract available