2412 search results - page 58 / 483 » Which Problems Have Strongly Exponential Complexity |
110
click to vote
SIAMDM
2002
15 years 8 days ago
2002
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
JOI
2008
15 years 17 days ago
2008
International collaboration as measured by co-authorship relations on refereed papers grew linearly from 1990 to 2005 in terms of the number of papers, but exponentially in terms ...
AIPS
2009
15 years 1 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
103
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...