2015
DOI: 10.1016/j.jco.2014.09.003
|View full text |Cite
|
Sign up to set email alerts
|

Proof techniques in quasi-Monte Carlo theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
2
1

Relationship

5
4

Authors

Journals

citations
Cited by 21 publications
(10 citation statements)
references
References 92 publications
(158 reference statements)
0
10
0
Order By: Relevance
“…We assume some familiarity with the proof of Roth in the language of Haar functions, as can be found, e.g., in [2] or [6]. We only prove the case d = 2; the extension to general d is done as for Roth…”
mentioning
confidence: 99%
“…We assume some familiarity with the proof of Roth in the language of Haar functions, as can be found, e.g., in [2] or [6]. We only prove the case d = 2; the extension to general d is done as for Roth…”
mentioning
confidence: 99%
“…Proof. We assume some familiarity with the proof of Roth in the language of Haar functions as it can be found, e.g., in [2] or [6]. We only prove the case d = 2, the extension to general d is done as for Roth's lower bound.…”
Section: Proposition 3 Formentioning
confidence: 99%
“…With standard techniques one can prove a Koksma-Hlawka inequality according to D π (w, P n ). For details we refer to [7], […”
Section: Integration Error and Weighted Star-discrepancymentioning
confidence: 99%