A. A. Evdokimov, “Maximal length of circuit in a unitary $n$-dimensional cube”, Mat. Zametki, 6:3 (1969), 309–319; Math. Notes, 6:3 (1969), 642

Loading [MathJax]/jax/output/CommonHTML/jax.js

Matematicheskie Zametki

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Forthcoming papers
	Archive
	Impact factor
	Guidelines for authors
	License agreement
	Submit a manuscript

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Mat. Zametki:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Matematicheskie Zametki, 1969, Volume 6, Issue 3, Pages 309–319 (Mi mzm6937)

This article is cited in 9 scientific papers (total in 9 papers)

Maximal length of circuit in a unitary

$n$ -dimensional cube

A. A. Evdokimov

Sobolev Institute of Mathematics, Siberian Branch of the USSR Academy of Sciences

Full-text PDF (909 kB) Citations (9)

Abstract: In a unit

$n$ -dimensional cube a circuit is constructed of length

$\mathrm{const}\cdot2^n$ . Thus, the order is found of the maximal length of a circuit.

Received: 23.09.1968

English version:
Mathematical Notes, 1969, Volume 6, Issue 3, Pages 642–648
DOI: https://doi.org/10.1007/BF01119684

Bibliographic databases:

UDC: 51.01.16

Language: Russian

Citation: A. A. Evdokimov, “Maximal length of circuit in a unitary

$n$ -dimensional cube”, Mat. Zametki, 6:3 (1969), 309–319; Math. Notes, 6:3 (1969), 642–648

Citation in format AMSBIB

\Bibitem{Evd69}

\by A.~A.~Evdokimov

\paper Maximal length of circuit in a~unitary $n$-dimensional cube

\jour Mat. Zametki

\yr 1969

\vol 6

\issue 3

\pages 309--319

\mathnet{http://mi.mathnet.ru/mzm6937}

\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=254738}

\zmath{https://zbmath.org/?q=an:0216.55802}

\transl

\jour Math. Notes

\yr 1969

\vol 6

\issue 3

\pages 642--648

\crossref{https://doi.org/10.1007/BF01119684}

Linking options:

https://www.mathnet.ru/eng/mzm6937

https://www.mathnet.ru/eng/mzm/v6/i3/p309

This publication is cited in the following 9 articles:

I. S. Bykov, “ $2$ -Factors without close edges in the $n$ -dimensional cube”, J. Appl. Industr. Math., 13:3 (2019), 405–417
I. P. Chukhrov, “On the complexity of minimizing quasicyclic Boolean functions”, J. Appl. Industr. Math., 12:3 (2018), 426–441
Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright, “Dynamics at the Boundary of Game Theory and Distributed Computing”, ACM Trans. Econ. Comput., 5:3 (2017), 1
A. A. Evdokimov, “Tsepnye kody i Snake-in-the-Box Problem”, Uchen. zap. Kazan. un-ta. Ser. Fiz.-matem. nauki, 156, no. 3, Izd-vo Kazanskogo un-ta, Kazan, 2014, 55–65
A. D. Korshunov, “Some unsolved problems in discrete mathematics and mathematical cybernetics”, Russian Math. Surveys, 64:5 (2009), 787–803
Yury Chebiryak, Daniel Kroening, 2008 International Symposium on Information Theory and Its Applications, 2008, 1
Jerzy Wojciechowski, “On constructing snakes in powers of complete graphs”, Discrete Mathematics, 181:1-3 (1998), 239
A. A. Sapozhenko, I. P. Chukhrov, “Boolean function minimization in the class of disjunctive normal forms”, J. Soviet Math., 46:4 (1989), 2021–2052
I. B. Gurevich, “Noncalculability in the class of local algorithms for certain predicates associated with the problem of minimization of Boolean functions”, Cybern Syst Anal, 10:2 (1975), 219

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	686
Full-text PDF :	198
First page:	1

Registration to the website

Logotypes