19320 search results - page 272 / 3864 » On the complexity of computing determinants |
185
click to vote
ICGI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
157
Voted
CSCWD
2001
Springer
15 years 11 months ago
2001
Springer
Collaborative design is challenging because strong interdependencies between design issues make it difficult to converge on a single design that satisfies these dependencies and i...
172
click to vote
FSTTCS
1994
Springer
15 years 10 months ago
1994
Springer
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...
165
click to vote
DLT
2009
15 years 4 months ago
2009
We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal...
167
click to vote
AML
2007
15 years 6 months ago
2007
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...