Preview
Unable to display preview. Download preview PDF.
References
E. Belaga. — Some problems involved in the calculation of polynomials (Russian), Dokl. Akad. Nauk SSSR, vol. 123 (1958) 775–777.
E. Belaga. — Evaluation of polynomials of one variable with preliminary processing of the coefficients, Problems of Cybernetics, vol. 5 (1964) 1–13.
E. Belaga. — An introduction to the trans-box method, Report, Université Louis Pasteur, Strasbourg, France, January 1983.
E. Belaga. — The trans-box method fundamentals, Parts 1–3, Université Louis Pasteur, Strasbourg, France, January 1983.
E. Belaga. — Through the mincing machine with a layer cake, Part 1, Report, Université Louis Pasteur, Strasbourg, France, Avril 1983.
E. Belaga. — Through the mincing machine with a layer cake, Part 2, Report, Université Louis Pasteur, Strasbourg, France, October 1983.
E. Belaga. — Through the mincing machine with a layer cake, Part 3: Linear functions and algorithms, To appear.
E. Belaga. — Through the mincing machine with a layer cake, Part 4: Bilinear functions and algorithms, To appear.
E. Belaga. — Rank resistibility, In preparation.
E. Belaga. — A new look at a straight-line algorithm, To appear.
A. Borodin and I. Munro. — The Computational Complexity of Algebraic and Numerical Problems, American Elsevier, New York, 1975.
A. Borodin. — Structured vs general models in computational complexity, Monographie no30 de l'Enseignement Mathématique, (1982) 47–65.
P. Cohn. — Universal Algebra, Harper & Row, New York, Evanston & London, and John Weatherhill, Inc. Tokyo, 1965.
J. Conway. — Regular Algebra and Finite Machines, London, 1971.
S. Cook. — Towards a complexity theory of synchronous parallel computation, Monographie no 30 de l'Enseignement Mathématique, Université de Genève (1982), 75–100.
S. Cook. — The classification of problems which have fast parallel algorithms, Lecture Notes in Computer Science 158, Springer-Verlag, Berlin, etc. (1983) 78–93.
G. Lorentz. — Approximation of Functions, New York, etc. 1966.
T. Motzkin. — Evaluation of polynomials and evaluation of rational functions, Bull. Amer. Math. Soc., vol. 61: 2 (1955), p. 163.
J. Savage. — The complexity of computing, New York, 1965.
C. Shannon. — A symbolic analysis of relay and switching circuits, Trans. AIEE, vol. 57 (1938) 713–723.
A. Slisenko. — Complexity problems in computation theory, Russian Math. Surveys, vol. 36, n°6 (1981) 23–125.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belaga, E.G. (1984). Locally synchronous complexity in the light of the trans-box method. In: Fontet, M., Mehlhorn, K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-12920-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12920-2
Online ISBN: 978-3-540-38805-0
eBook Packages: Springer Book Archive