4488 search results - page 16 / 898 » Properties of NP-Complete Sets |
DM
2007
13 years 7 months ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...
INDOCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a bett...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
COMBINATORICS
2007
13 years 7 months ago
2007
The unitary Cayley graph Xn has vertex set Zn = {0, 1, . . . , n−1}. Vertices a, b
BMCBI
2007
13 years 7 months ago
2007
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...