153 search results - page 2 / 31 » On an equivalence in discrete extremal problems |
COMPGEOM
2008
ACM
13 years 8 months ago
2008
ACM
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
NETWORKS
2006
13 years 6 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
PKC
2000
Springer
13 years 10 months ago
2000
Springer
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
SIAMNUM
2011
12 years 9 months ago
2011
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
SETA
2004
Springer
13 years 11 months ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...