2446 search results - page 135 / 490 » Choiceless Polynomial Time |
86
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
107
click to vote
ALT
2008
Springer
15 years 9 months ago
2008
Springer
It is investigated for which choice of a parameter q, denoting the number of contexts, the class of simple external contextual languages is iteratively learnable. On one hand, the ...
88
Voted
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
91
Voted
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...