History


Help on query formulation
first | previous | 1 | next | last

Result 1 to 11 of 11 total

Discrete mathematics. (English)
Oxford Higher Education. Oxford: Oxford University Press (ISBN 978-0-19-806543-2/pbk). xvi, 567~p. (2011).
Classification: N70 Reviewer: Ulrich Knauer (Oldenburg)
1
Divisibility by 4 and 8 for smaller natural numbers. (English)
Int. J. Math. Educ. Sci. Technol. 38, No. 5, 699-701 (2007).
Classification: F60
2
A random walk phenomenon under an interesting stopping rule. (English)
Int. J. Math. Educ. Sci. Technol. 38, No. 3, 407-412 (2007).
Classification: K60
3
A new sorting algorithm. (English)
InterStat, No. 5, 9 p. (2006).
Classification: P50
4
Empirical $O(n^2$) complexity is convincingly gettable with two dense matrices in nxn matrix multiplication! (English)
InterStat, No. 5, 9 p. (2006).
Classification: P20 N30
5
How robust are average complexity measures? A statistical case study. (English)
InterStat, No. 7, 17 p. (2006).
Classification: K95 K75
6
A note on Des Raj’s ordered estimator for SRSWOR. (English)
InterStat, No. 5, 7 p. (2006).
Classification: K90
7
A statistical adventure towards getting an empirical $O(n^2)$ complexity in nxn matrix multiplication. (English)
InterStat, No. 3, 7 p. (2006).
Classification: K90
8
Some aspects of a sub-class of modified power series distribution. (English)
InterStat, No. 4, 22 p. (2006).
Classification: K75
9
On why parameters of input distributions need be taken into account for a more precise evaluation of complexity for certain algorithms. (English)
InterStat, No. 10, 13 p. (2005).
Classification: K65 K95
10
A few relations for sums of differences of discrete probability distributions. (English)
InterStat, No. 1, 7 p. (2005).
Classification: K65
11
first | previous | 1 | next | last

Result 1 to 11 of 11 total

Valid XHTML 1.0 Transitional Valid CSS!