1383 search results - page 28 / 277 » On the Complexity of the Interlace Polynomial |
EOR
2008
14 years 10 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
ENDM
2010
14 years 10 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
SAS
2005
Springer
15 years 3 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
INDOCRYPT
2003
Springer
15 years 3 months ago
2003
Springer
We consider a variant of the Complex Multiplication (CM) method for constructing elliptic curves (ECs) of prime order with additional security properties. Our variant uses Weber po...