Size-depth tradeoff in non-monotone Boolean formulae-Reference-Cited by-同舟云学术

Size-depth tradeoff in non-monotone Boolean formulae

Published:1980-09 Issue:3 Volume:14 Page:257-269
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Commentz-Walter Beate,Sattler Juergen

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00264256.pdf

Reference25 articles.

1. Borodin A, Munro I (1975) The computational complexity of algebraic and numeric problems. Theory of computation series 1, Elsevier, New York

2. Brent RP (1974) The parallel evaluation of general arithmetic expressions. J. Assoc. Comput. Mach. 21:201–206

3. Brent RP (1973) The parallel evaluation of general arithmetic expressions. In: Logarithmic time, Proc. Symposium on complexity and parallel numerical algorithms (May 1973) Academic Press, New York, p 83

4. Brent RP, Kuck DJ, Maruyama KM (1973) The parallel evaluation of arithmetic expressions without division. IEEE Trans. Computers 22:532–534

5. Commentz-Walter B (1978) Tradeoff zwischen Größe und Tiefe Boolescher Formeln. Dissertation, Universität des Saarlandes, Math.-Nat.-Fakultät

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constructing depth-optimum circuits for adders and And-Or paths;Discrete Applied Mathematics;2022-03

2. ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO;Prikladnaya Diskretnaya Matematika;2020-06

3. Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times;ACM Transactions on Algorithms;2019-10-12

4. On a Relation Between the Depth and Complexity of Monotone Boolean Formulas;Journal of Applied and Industrial Mathematics;2019-10

5. On possibility of refining bounds for the delay of a parallel adder;Journal of Applied and Industrial Mathematics;2008-06