1383 search results - page 74 / 277 » On the Complexity of the Interlace Polynomial |
164
click to vote
CAGD
2008
15 years 6 months ago
2008
A plane algebraic curve can be represented as the zero-set of a polynomial in two - or if one takes homogenous coordinates: three - variables. The coefficients of the polynomial de...
184
click to vote
COCO
2007
Springer
16 years 13 days ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
153
click to vote
IS
2010
15 years 4 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
210
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
164
click to vote
TON
2008
15 years 6 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...