Literature Cited
V. M. Glushkov, “Problems of automata theory and artificial intelligence,” Kibernetika, No. 2, 3–13 (1970).
V. M. Glushkov, “System of automation of proofs (SAF),” in: Automated Processing of Mathematical Texts [in Russian], IK Akad. Nauk SSSR, Kiev (1980), pp. 3–30.
V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Instrumental hardware for development of programs for mathematical text processing,” Kibernetika, No. 2, 3–14 (1972).
Yu. V. Kapitonova, K. P. Vershinin, A. I. Degtyarev, A. P. Zhezhurun, and A. V. Lyaletskii, “A system of mathematical test processing,” Kibernetika, No. 2, 15–25 (1979).
S. Comet, “On the machine calculation of characters of the symmetric group,” in: Tolfte Skandinaviske Matematikerkongressen, Lund (1953), pp. 18–23.
P. A. Bandler, A Method of Enumerating the Cosets of an Abstract Group on a Digital Computer, Manchester University (1956).
V. Felsch, A Bibliography on the Use of Computers in Group Theory and Related Topics: Algorithms, Implementations, and Applications, Aachen University (1978).
M. Ashbakher, “Finite simple groups and their classification,” Usp. Mat. Nauk,36, No. 2, 141–172 (1981).
A. G. Kurosh, Theory of Groups, Chelsea Publ.
L. A. Kaluzhnin and A. A. Stognii, “Theory and practice of computer uses in algebraic research,” in: Computations in algebra and Combinatorics [in Russian], IK Akad. Nauk SSSR, Kiev (1978), pp. 3–40.
B. J. Birch and H. P. F. Suinnerton-Dyer, “Notes on elliptic curves: I, II,” J. Reine Angew. Math., No. 212, 7–25 (1963); No. 218, 79–108 (1965).
N. M. Stephens, “The Diophantine equation x3+y3=Dz3 and the conjectures of Birch and Suinnerton-Dyer,” J. Reine Angew. Math., No. 223, 121–162 (1968).
Yu. I. Manin, “Cyclotomic fields and modular curves,”, Usp. Mat. Nauk,26, No. 6, 7–71 (1971).
Yu. I. Manin, “Parabolic points and zeta-functions of modular curves,” Izv. Akad. Nauk SSSR, Ser. Mat.,31, No. 6, 1351–1367 (1972).
A. Weil, “Definition of Dirichlet series through functional equations,” Matematika,14, No. 6, 138–145 (1970).
K. Iwasawa, “Analogies between number fields and function fields,” in: Proc. Sci. Conf. Yeshina Univ. (Japan) (1963), pp. 48–56.
K. Iwasawa and C. C. Sims, “Computations of invariants in the theory of cyclotomic fields,” J. Math. Soc. Jpn.,18, No. 1, 86–96 (1966).
N. M. Glazunov, Algorithms and Programs for Studies in Diophantine Geometry [in Russian], Kiev (1973). (IK Akad. Nauk USSR, Preprint 73-16).
J. T. Tate, “The arithmetic on elliptic curves,” Invent. Math.,23, Nos. 3/4, 456–470 (1974).
N. M. Glazunov, “Algorithms for calculation of rational points on elliptic curves and their computer implementation,” in: Abstracts of Proceedings of All-Union Institute on Theory of Numbers [in Russian], MIAI-TGU, Dushanbe (1977), p. 31.
A. C. Hearn, REDUCE-2, User's Manual, UCP-19, University of Utah, Salt Lake City (1973).
I. E. Zhidkov, I. P. Nedyalkov, and V. A. Rostovtsev, “Application of a system for solution of a problem of the general relativity theory,” in: Proceedings of an International Conference on the Systems and Methods of Computerized Analytic Calculations [in Russian], IYaI Akad. Nauk SSSR, Dubna (1980), pp. 134–137.
W. Lasner, “Noncommutative algebras prepared for computer calculation,” Proceedings of an International Conference on the Systems and Methods of Computerized Analytic Calculations, IYaI Akad. Nauk SSSR, Dubna (1980), pp. 134–137.
N. N. Govorun (ed.), Proceedings of an International Conference on the Systems and Methods of Computerized Analytic Calculations [in Russian], IYaI Akad. Nauk SSSR, Dubna (1980).
G. Polya, “Combinatorial calculations for groups, graphs, and chemical structures,” in: Enumeration Problems of Combinatorial Analysis [Russian translation], Mir, Moscow (1979), pp. 36–139.
J. G. Redfield, “Theory of distributions reduced for groups,” in: Enumeration Problems of Combinatorial Analysis [Russian translation], Mir, Moscow (1979), pp. 9–36.
N. G. De Bruyn, “Review of Polya's enumeration theorem,” in: Enumeration Problems of Combinatorial Analysis [Russian translation], Mir, Moscow (1979), pp. 229–256.
I. Kh. Faradzhaev (ed.), Algorithmic Studies in Combinatorics [in Russian], Nauka, Moscow (1978).
G. N. Povarov, “Group invariance and Boolean functions,” in: Logic Applications in Science and Technology [in Russian], Izd. Akad. Nauk SSSR, Moscow (1960), pp. 263–341.
W. S. Javons, Principles of Science [in Russian], St. Petersburg (1881).
W. K. Clifford, “On the types of compound statement involving four classes,” Proc. Lit. Philos. Manchester, No. 16, 88–101 (1877).
G. Polya, “Sur les types des propositions composées,” J. Symbolic Logic,5, No. 3, 98–103 (1940).
V. I. Shestakov (ed.), Synthesis of Electronic computational and Control Circuits [Russian translation], IL, Moscow (1954).
V. I. Sushchanskii and V. A. Ustimenko-Bakumovskii, “Characterization of the types of Boolean algebras,” in: Calculations in Algebra, Theory of Numbers, and Combinatorics [in Russian], IK Akad. Nauk USSR, Kiev (1980), pp. 47–59.
I. É. Strazdin', “Affine classification of Boolean functions of five variables,” Avtom. Vychisl. Tekh., No. 1, 1–9 (1975).
I. É. Strazdin', Tables of Four-Variable Boolean Functions [in Russian], Moscow (1974). (Manuscript deposited with VINITI 8/14/74, No. 1495-74.)
V. A. Ustimenko-Bakumovskii, “Algorithms for construction of flowcharts and strongly regulated graphs with a given group of automorphisms,” in: Calculations in Algebra and Combinatorics [in Russian], IK Akad. Nauk USSR, Kiev (1978), pp. 101–107.
M. Hall, Combinatorics [Russian translation], Mir, Moscow (1970).
N. M. Glazunov, “Applications of a dialogue system of programming in mathematical research,” Upr. Sist. Mash., No. 6, 48–56 (1974).
J. Cannon, The Cayley Library of Built-In Functions: Technical Report, No. 13, Department of Pure Mathematics, University of Sydney, Sydney (1976).
V. Press, “CAMAC,” in: Combinatorial and Algebraic Conference on Combinatorial and Graph Computation, Boce Baton (1975), pp. 505–511.
A. A. Stognii, N. M. Glazunov, and G. P. Kozhevnikova, “A class of data processing systems oriented towards mathematical research,” Kibernetika, No. 1, 6–11 (1977).
L. A. Kaluzhnin, N. M. Glazunov, and V. I. Sushchanskii, “A programming system for solution of combinatorial problems of modern algebra,” in: Proceedings of an International Conference on Systems and Methods of Computerized Analytical Calculation [in Russian], IYaI Akad. Nauk SSSR, Dubna (1980), pp. 23–36.
Additional information
Translated from Kibernetika, No. 2, pp. 1–10, March–April, 1983.
Rights and permissions
About this article
Cite this article
Kaluzhnin, L.A., Stognii, A.A., Glazunov, N.M. et al. Development of computer-assisted algebraic research. Cybern Syst Anal 19, 149–160 (1983). https://doi.org/10.1007/BF01072013
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01072013