2143 search results - page 102 / 429 » corr 2010 |
35
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
ndence fails. In the conclusion we address the question of an abstract criterion that explains the results.
CORR
2010
Springer
15 years 25 days ago
2010
Springer
(Non-)portability of Prolog programs is widely considered as an important factor in the lack of acceptance of the language. Since
96
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
CORR
2010
Springer
15 years 25 days ago
2010
Springer
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]
47
Voted
CORR
2010
Springer
15 years 9 days ago
2010
Springer
A completion of an m-by-n matrix A with entries in {0,1,} is obtained by setting all -entries to