|
931 |
Uncomputability and computational completeness below and up to the real halting problem
Meer, Klaus. - Bonn : Forschungsinst. für Diskrete Mathematik, 2006
|
|
|
|
932 |
Vergleich unstetiger Funktionen
Mylatz, Uwe, 2006
|
|
|
|
933 |
A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization
Ghasemzadeh, Mohammad, 2005
|
|
|
|
934 |
A non-deterministic call-by-need lambda calculus
Mann, Matthias, 2005
|
|
|
|
935 |
Advances in equational theorem proving
Löchner, Bernd, 2005
|
|
|
|
936 |
Aesthetics and automatic layout of UML class diagrams
Eichelberger, Holger, 2005
|
|
|
|
937 |
Algebraic closures in complexity theory
Böhler, Elmar, 2005
|
|
|
|
938 |
An improved bound on the cardinality of the minimal pairwise balanced designs on 18 points with maximum block size 4
Rostock : Univ., Inst. für Mathematik, 2005
|
|
|
|
939 |
Approximation properties of non-separable wavelet bases with isotropic scaling matrices and their relation to Besov spaces
Lindemann, Mathias. - Bremen : University Bremen, 2005
|
|
|
|
940 |
Attributed graph transformation with node type inheritance
Berlin : TU, Professoren der Fak. IV, 2005
|
|
Administration
