1383 search results - page 122 / 277 » On the Complexity of the Interlace Polynomial |
165
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
131
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
156
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
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...