2976 search results - page 254 / 596 » On the bounded integer programming |
134
Voted
CORR
2004
Springer
15 years 4 months ago
2004
Springer
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into f , the f-dimensional Fibonacci cube. We give b...
131
Voted
BSL
2000
15 years 4 months ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
160
click to vote
TAMC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
168
Voted
ISAAC
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
169
click to vote
DCC
2011
IEEE
15 years 1 days ago
2011
IEEE
For odd integer m ≥ 3 and t = 0, 1, . . . , m−1 2 , we define Family V (t) to be a set of size 2m(t+1) containing binary sequences of period 2m+1 − 2. The nontrivial correl...