1379 search results - page 122 / 276 » The Complexity of the Annihilating Polynomial |
150
click to vote
UC
2005
Springer
15 years 12 months ago
2005
Springer
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
144
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
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...