RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika

Diskr. Mat., 1995, Volume 7, Issue 4, Pages 77–85 (Mi dm602)

New inequality relations between depth and delay
V. M. Khrapchenko

This publication is cited in the following articles:
  1. S. B. Gashkov, I. S. Sergeev, “O znachenii rabot V. M. Khrapchenko”, PDM, 2020, no. 48, 109–124  mathnet  crossref
  2. D. V. Zakablukov, “Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates”, Moscow University Mathematics Bulletin, 71:3 (2016), 89–97  mathnet  crossref  mathscinet  isi  elib
  3. A. D. Korshunov, “Computational complexity of Boolean functions”, Russian Math. Surveys, 67:1 (2012), 93–165  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
  4. V. M. Khrapchenko, “The fundamental difference between depth and delay”, Discrete Math. Appl., 18:4 (2008), 391–412  mathnet  crossref  crossref  mathscinet  zmath  elib


© Steklov Math. Inst. of RAS, 2025