Volume 4 (1983)

Front pages

Pages: 1–2

On the smallest and largest elements

Á. Varecza

Pages: 3–10

On numerical applications of excluding theorems

F. Kálovics and Z. Erdélyi

Pages: 11–20

Numerische Lösung der Differenzialgleichung \(y=f(x;y;y')\) mit Spline-Funktion

János Győrvári

Pages: 21–27

The method of Gibbs–Poole–Stockmeyer is non-heuristic

Ilona Arany

Pages: 29–37

Another method for finding pseudo-peripherial nodes

Ilona Arany

Pages: 39–49

A practical way of comparison of programs based on pattern recognition

A. F. Gubkin

Pages: 51–58

Sur la résolution numérique d’un problème aux limites multi-points

Katalin Károlyi

Pages: 59–66

Polynomial lower bounds for the complexity of establishing the solvability of logical-arithmetical equations (in Russsion)

N. K. Kosovskiĭ

Pages: 67–73

On the Leibnizian quadrature of the circle

Miklós Horváth

Pages: 75–83

Parallel processing of 0—1 sequences

Anntal Iványi and József Pergel

Pages: 85–95

Facts in place/transition-nets with unrestricted capacities

Rüdiker Valk

Pages: 97–105

On the Remez-algorithm

I. Környei

Pages: 107–111

Depth of functions of the algebra of logic in certain bases (in Russian)

S. A. Lozhkin

Pages: 113–125

The approximate solution of non-linear functional equations by a Steffensen-type method

Á. Várhelyi

Pages: 127–131

Index of Volume 4

Pages: 133–133

Back pages

Pages: 135–135

ELTE FI