2976 search results - page 125 / 596 » On the bounded integer programming |
EUROCOLT
1999
Springer
15 years 4 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
89
Voted
ESA
2007
Springer
15 years 6 months ago
2007
Springer
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...
81
Voted
CORR
2008
Springer
15 years 21 days ago
2008
Springer
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
DAM
2007
15 years 17 days ago
2007
Abstract. It is well known that the degree of a 2m-variable bent function is at most m. However, the case in homogeneous bent functions is not clear. In this paper, it is proved th...
90
Voted
SIAMDM
2008
15 years 16 days ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...