counting colours in compressed strings Travis Gagie Juha K¨arkk¨ainen CPM 2011

First Page		Document Content
Date: 2011-09-22 14:04:56 Arithmetic functions Analysis of algorithms Asymptotic analysis Mathematical notation Number theory Computational complexity of mathematical operations Chebyshev function Mathematics Mathematical analysis Theoretical computer science		counting colours in compressed strings Travis Gagie Juha K¨arkk¨ainen CPM 2011 Add to Reading List Source URL: www.cs.ucr.edu Download Document from Source Website File Size: 158,33 KB Share Document on Facebook

	Continued fractions and number systems: applications to correctly-rounded implementations of elementary functions and modular arithmetic. Mourad Gouicem PEQUAN Team, LIP6/UPMC DocID: 1uA3L - View Document
	Directed Rounding Arithmetic Operations ISO WG21 Document : N2811=Guillaume Melquiond and Sylvain PionAbstract We propose the addition of new functions to the C++0x standard library that provide DocID: 1tq1o - View Document
	FAST ROUNDING OF FLOATING POINT NUMBERS DocID: 1rtx5 - View Document
	Numbers, constants and computation 1 Numerical evaluation of the Riemann Zeta-function DocID: 1rmQO - View Document
	Ordered Contribution Allocations: Theoretical Properties and Applications Patrick Cheridito∗ Princeton University Princeton, USA DocID: 1r8EO - View Document