1383 search results - page 20 / 277 » On the Complexity of the Interlace Polynomial |
TGC
2007
Springer
15 years 4 months ago
2007
Springer
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
TCOM
2010
14 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
14 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 ...
105
click to vote
CORR
2012
Springer
13 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
14 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...