Diskr. Mat., 1990, Volume 2, Issue 4

JOURNALS // Diskretnaya Matematika // Archive

1990, Volume 2, Issue 4

	A finite system of axioms for the model companion of the theory of all multitrees G. E. Puninskii	3
	On conditions realizing the partitioning of the parameter domain in a Chebyshev extremal problem L. S. Stoikova	11
	Closed classes in $k$-valued logic with an operation of branching by predicates V. D. Solov'ev	18
	The complexity of the approximate calculation of real numbers by means of schemes and formulas in various rational bases S. B. Gashkov	26
	On the nonexistence of even 4-critical graphs of order 12 I. A. Muzychuk	47
	A lower bound on the register complexity of the computation of terms Yu. V. Yatsishin	60
	Upper bounds on exponents of pseudosymmetric graphs A. V. Knyazev	63
	Construction of the minimal enclosing parallelogram A. D. Vainshtein	72
	On the structure of random oriented graphs with distinguished edges S. P. Cherkashin	82
	Estimates for functionals of a density constructed from discretized observations V. P. Borovikov	92
	Embeddings of graphs in a surface and the theory of flow graphs V. B. Alekseev, V. P. Korzhik	97
	Problems of completeness for finitely generated functional systems $\langle P_{k,2},\widetilde\Omega\rangle$ and $\langle P_{k,2},\widehat\Omega\rangle$ Zh. Dou	116

Information
	All-Union conference dedicated to the 70th anniversary of S. Kh. Sirazhdinov	125