1383 search results - page 168 / 277 » On the Complexity of the Interlace Polynomial |
158
click to vote
AAAI
2004
15 years 7 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
140
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Machining time is a major performance criterion when it comes to high speed machining. CAM software can help in estimating that time for a given strategy. But in practice, CAM pro...
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
154
click to vote
IPL
2007
15 years 6 months ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
157
click to vote
JSC
2010
15 years 4 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...