1301 search results - page 141 / 261 » Bounded Version Vectors |
101
Voted
AAIM
2009
Springer
15 years 7 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
96
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
85
Voted
CSR
2007
Springer
15 years 6 months ago
2007
Springer
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
102
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
81
Voted
FSE
2001
Springer
15 years 5 months ago
2001
Springer
In this paper, we describe new results on the security, in the Luby-Rackoff paradigm, of two modified Feistel constructions, namely the L-scheme, a construction used at various l...