1998 search results - page 33 / 400 » Complexity of the Cover Polynomial |
TCOM
2010
13 years 8 months ago
2010
—This paper deals with the case of a high speed mobile receiver operating in an orthogonal-frequency-divisionmultiplexing (OFDM) communication system. Assuming the knowledge of d...
DISOPT
2008
13 years 10 months ago
2008
This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and ...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
IWPEC
2010
Springer
13 years 7 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...