36781 search results - page 157 / 7357 » Parameterizing by the Number of Numbers |
114
Voted
TCS
2002
15 years 8 days ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
106
Voted
SIAMDM
2008
15 years 3 days ago
2008
Inspired by MacMahon's original proof of his celebrated theorem on the distribution of the major index over permutations, we give a reformulation of his argument in terms of l...
122
click to vote
SWAT
2010
Springer
14 years 10 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
186
Voted
COCOON
2009
Springer
14 years 10 months ago
2009
Springer
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
76
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems...