1383 search results - page 103 / 277 » On the Complexity of the Interlace Polynomial |
162
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
158
click to vote
DATE
2007
IEEE
16 years 20 days ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
169
click to vote
SOFSEM
2007
Springer
16 years 13 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
146
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
171
click to vote
ISQED
2000
IEEE
15 years 10 months ago
2000
IEEE
We address the problem of power estimation at the register-transfer level (RTL). At this level, the circuit is described in terms of a set of interconnected memory elements and co...