1089 search results - page 75 / 218 » Bounds on generalized Frobenius numbers |
AAIM
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of f...
CRYPTO
1991
Springer
14 years 19 days ago
1991
Springer
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page fra...
COMGEO
2006
ACM
13 years 9 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
CPC
2007
13 years 9 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...