B. Codenotti, P. Gemmell, and J. Simon, Average Circuit Depth and Average Communication Complexity, In Third European Symposium on Algorithms, Lecture Notes in Computer Science, Springer-Verlag, 102--112 (1995). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On the Depth of Randomly Generated Circuits - Tatsuie Tsukiji (1996) (1 citation) (Correct)
....the constant, i.e. the depth of C a;n converges to 2e ln n in probability. Thus, in terms of parallel time computation, we have that the expected time to decide the output of a monotone CVP is 2e ln n, asymptotically. Another interesting related work in this line is that of Codenotti et al. [2], where strong lower bounds on the expected parallel time to compute Boolean functions by circuits are given. They consider self time circuits a model in which gates compute their output as soon as it is determined (possibly by a subset of the inputs to the gate) 2 Proof Outline, Definitions ....
B. Codenotti, P. Gemmell, and J. Simon, Average Circuit Depth and Average Communication Complexity, In Third European Symposium on Algorithms, Lecture Notes in Computer Science, Springer-Verlag, 102--112 (1995).
On the Depth of Randomly Generated Circuits - Tatsuie Tsukiji (1996) (1 citation) (Correct)
....the constant, i.e. the depth of C a;n converges to 2e ln n in probability. Thus, in terms of parallel time computation, we have that the expected time to decide the output of a monotone CVP is 2e ln n, asymptotically. Another interesting related work in this line is that of Codenotti et al. CGS95] where strong lower bounds on the expected parallel time to compute Boolean functions by circuits are given. They consider self time circuits a model in which gates compute their output as soon as it is determined (possibly by a subset of the inputs to the gate) 2 Proof Outline, Definitions ....
Codenotti, B., Gemmell, P., and Simon, J.: Average Circuit Depth and Average Communication Complexity. In Third European Symposium on Algorithms, Lecture Notes in Comp. Sc. Springer-Verlag (1995) 102--112
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC