8699 search results - page 206 / 1740 » Elements of the Theory of Computation |
151
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
189
click to vote
LSSC
2007
Springer
16 years 21 days ago
2007
Springer
A successive refinement of a finite element grid provides a sequence of nested grids and hierarchy of nested finite element spaces as well as a natural hierarchical decompositio...
141
click to vote
MFCS
1993
Springer
15 years 10 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
127
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...
161
click to vote
MCS
2007
Springer
15 years 6 months ago
2007
Springer
Most results related to discrete nonnegativity conservation principles (DNCP) for elliptic problems are limited to finite differences (FDM) and lowest-order finite element meth...