1695 search results - page 9 / 339 » Linear, Polynomial or Exponential |
112
Voted
COCO
2001
Springer
15 years 5 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 ...
CORR
2010
Springer
15 years 22 days ago
2010
Springer
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]
64
Voted
CORR
2007
Springer
15 years 19 days ago
2007
Springer
67
Voted
FFA
2007
15 years 18 days ago
2007
103
Voted
COCOA
2007
Springer
15 years 6 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...