395 search results - page 33 / 79 » Positive Versions of Polynomial Time |
117
click to vote
IJCAI
1993
15 years 5 months ago
1993
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
138
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
162
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
112
click to vote
SODA
2010
ACM
16 years 1 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...
131
click to vote
IPPS
2009
IEEE
15 years 10 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...