2629 search results - page 12 / 526 » complex 2009 |
SSS
2009
Springer
14 years 4 months ago
2009
Springer
DLT
2009
13 years 7 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
ICALT
2009
IEEE
14 years 4 months ago
2009
IEEE
EUSFLAT
2009
13 years 7 months ago
2009
The present article dedicates itself to fuzzy modelling of data
CAV
2009
Springer
14 years 10 months ago
2009
Springer
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...