477 search results - page 42 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
AML
2011
13 years 3 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
RECOMB
2009
Springer
14 years 3 months ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
ANOR
2011
13 years 13 days ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...