2095 search results - page 12 / 419 » Improved pebbling bounds |
JCO
1998
13 years 9 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
SAT
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
LICS
2009
IEEE
14 years 4 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
TIT
2008
13 years 9 months ago
2008
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We show that the number of unit-area triangles determined by a set of n points in the plane is O(n9/4+ε), for any ε > 0, improving the recent bound O(n44/19) of Dumitrescu et...