2778 search results - page 5 / 556 » Limit complexities revisited |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
COCOON
2009
Springer
14 years 4 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
ICASSP
2009
IEEE
14 years 4 months ago
2009
IEEE
STACS
1993
Springer
14 years 1 months ago
1993
Springer
CORR
2006
Springer
13 years 9 months ago
2006
Springer
