600 search results - page 47 / 120 » Problems and results in extremal combinatorics - II |
121
click to vote
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
MP
2006
14 years 9 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
CJTCS
1999
14 years 9 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
100
click to vote
CALC
2001
Springer
15 years 2 months ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...