1695 search results - page 9 / 339 » Linear, Polynomial or Exponential |
141
Voted
COCO
2001
Springer
15 years 8 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
104
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]
87
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
92
Voted
FFA
2007
15 years 3 months ago
2007
124
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...