28888 search results - page 382 / 5778 » Computability and complexity in analysis |
171
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
198
click to vote
MDAI
2009
Springer
15 years 11 months ago
2009
Springer
Presented is preliminary study of the role of data structures in algorithms for formal concept analysis. Studied is performance of selected algorithms in dependence on chosen data ...
171
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
184
click to vote
IVCNZ
1998
15 years 8 months ago
1998
: Interval arithmetic is a method for performing computations on measurements that are only known to within a xed error range. As the measurements are combined mathematically, thei...