1998 search results - page 174 / 400 » Complexity of the Cover Polynomial |
181
click to vote
ACID
2006
15 years 8 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
174
click to vote
CANS
2009
Springer
16 years 1 months ago
2009
Springer
At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an ini...
181
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
196
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
149
click to vote
CEEMAS
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. The complexity associated to Humanitarian Demining becomes very high due to its broad set of activities, which beyond the already complex of landmine removal, includes ot...