1383 search results - page 123 / 277 » On the Complexity of the Interlace Polynomial |
175
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...
151
click to vote
IPL
2008
15 years 6 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
158
click to vote
IPL
2007
15 years 6 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
152
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
159
click to vote
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...