1383 search results - page 7 / 277 » On the Complexity of the Interlace Polynomial |
DATE
1999
IEEE
15 years 4 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
FOCM
2008
14 years 11 months ago
2008
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
103
click to vote
MST
2011
14 years 2 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
151
click to vote
WINE
2010
Springer
14 years 9 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
DCG
2006
14 years 11 months ago
2006
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an app...