Discrepancy Bounds for Mixed Sequences Michael Gnewuch Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, MC 0401, New York, 10027 NY, USA email: [removed]

First Page		Document Content
Date: 2009-12-01 06:17:11 Applied mathematics Diophantine approximation Probabilistic complexity theory Low-discrepancy sequence Quasi-Monte Carlo method Monte Carlo method Randomized algorithm Mathematics Randomness Numerical analysis		Discrepancy Bounds for Mixed Sequences Michael Gnewuch Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, MC 0401, New York, 10027 NY, USA email: [removed] Add to Reading List Source URL: drops.dagstuhl.de Download Document from Source Website File Size: 124,54 KB Share Document on Facebook

	Diophantine approximation, scalar multiplication and decidability Philipp Hieronymi University of Illinois at Urbana-Champaign Colloquium Logicum 2016 DocID: 1uMMV - View Document
	Roth’s Theorem: an introduction to diophantine approximation Michael Nakamaye June 18, DocID: 1tdN5 - View Document
	ON FRACTAL MEASURES AND DIOPHANTINE APPROXIMATION DMITRY KLEINBOCK, ELON LINDENSTRAUSS, AND BARAK WEISS Abstract. We study diophantine properties of a typical point with respect to measures on Rn . Namely, we identify ge DocID: 1sqGR - View Document
	THE ABC CONJECTURE AND PRIME DIVISORS OF THE LUCAS AND LEHMER SEQUENCES RAM MURTY AND SIMAN WONG 1. Introduction A straightforward consequence of Thue’s pioneering work on Diophantine approximation [24] is: Let m be a DocID: 1snVy - View Document
	From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min Chen DocID: 1renq - View Document