SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Computational Complexity

Volumn 3, Issue 3, 1993, Pages 262-291

Shallow circuits and concise formulae for multiple addition and multiplication

(2) Paterson, Michael a Zwick, Uri b

a UNIVERSITY OF WARWICK (United Kingdom)

b TEL AVIV UNIVERSITY (Israel)

Author keywords

carry save addition; circuits; formulae; Multiplication; Subject classifications: 68Q25, 06E30, 94C10

Indexed keywords

EID: 0039033999 PISSN: 10163328 EISSN: 14208954 Source Type: Journal
DOI: 10.1007/BF01271371 Document Type: Article

Times cited : (12)

References (22)

1
- 84937078021
- Signed-digit number representation for fast parallel arithmetic
- (1961) IEEE Trans. Elect. Comput. EC , vol.10 , pp. 389-400
- Avizienis, A.¹

2
- 0014834562
- On the addition of binary numbers
- (1970) IEEE Trans. Comput. C , vol.19 , pp. 758-759
- Brent, R.¹

3
- 84934560667
- R. Boppana, M. Sipser, The complexity of finite functions, in Handbook of Theoretical Computer Science Vol. A: Algorithms and Complexity, J. van Leeuwen, ed., Elsevier/MIT Press, 1990, 757–804.

4
- 0001342967
- Some schemes for parallel multipliers
- (1965) Alta Frequenza , vol.34 , pp. 343-356
- Dadda, L.¹

5
- 84934560666
- P. E. Dunne, The Complexity of Boolean Networks, Academic Press, 1988.

6
- 0346819594
- Ω(n log n) lower bounds on length of Boolean formulas
- (1982) SIAM Journal on Computing , vol.11 , pp. 416-427
- Fischer, M.J.¹ Meyer, A.R.² Paterson, M.S.³

7
- 84934560665
- E. Grove, Proofs with potential, Ph.D. thesis, U.C. Berkeley, May 1993.

8
- 0001464763
- Multiplication of multidigit numbers on automata
- (1963) Soviet Phys. Dokl. , vol.7 , pp. 595-596
- Karatsuba, A.¹ Ofman, Y.²

9
- 0141485433
- Asymptotic estimation of addition time of a parallel adder
- (1967) Problemy Kibernet. , vol.19 , pp. 107-122
- Khrapchenko, V.M.¹

10
- 0010839572
- A method of determining lower bounds for the complexity of π-schemes
- (1972) Mat. Zametki , vol.10 , pp. 83-92
- Khrapchenko, V.M.¹

11
- 1542305882
- The complexity of the realization of symmetrical functions by formulae
- (1972) Mat. Zametki , vol.11 , pp. 109-120
- Khrapchenko, V.M.¹

12
- 84884988797
- Some bounds for the time of multiplication
- in Russian
- (1978) Problemy Kibernet. , vol.33 , pp. 221-227
- Khrapchenko, V.M.¹

13
- 84934560671
- J. von Neumann, O. Morgenstern, Theory of Games and Economic Behavior, Princeton Univ. Press, 1944.

14
- 84934560670
- M. S. Paterson, New bounds on formula size, Proc. 3rd GI Conf. Theoret. Comput. Sci. 1977, Lecture Notes in Computer Science48, Springer-Verlag 1977, 17–26.

15
- 84934560669
- M. S. Paterson, N. Pippenger, and U. Zwick, Faster circuits and shorter formulae for multiple addition, multiplication and symmetric Boolean functions, Proc. 31st Ann. IEEE Symp. Found. Comput. Sci., 1990, 642–650.

16
- 84934560668
- M. S. Paterson, N. Pippenger, and U. Zwick, Optimal carry save networks, in Boolean function complexity, M. S. Paterson, ed., LMS Lecture Note Series 169, Cambridge University Press, 1992, 1742-0201.

17
- 84934560662
- M. S. Paterson, U. Zwick, Shallow multiplication circuits, Proc. ARITH-10, (10th Ann. IEEE Symp. Computer Arithmetic), 1991, 28–34.

18
- 84934560663
- M. S. Paterson, U. Zwick, Shallow multiplication circuits and wise financial investments, Proc. 24th Ann. ACM Symp. Theor. Comput., 1992, 429–437.

19
- 84934560664
- G. L. Peterson, An upper bound on the size of formulae for symmetric Boolean functions, TR 78-03-01, University of Washington, 1978.

20
- 84934560655
- N. Pippenger, Short formulae for symmetric functions, IBM report RC 5143, Yorktown Heights, N. Y., 1974.

21
- 84937739956
- A suggestion for a fast multiplier
- (1964) IEEE Trans. Elect. Comput. EC , vol.13 , pp. 14-17
- Wallace, C.S.¹

22
- 84934560654
- I. Wegener, The Complexity of Boolean Functions, Wiley-Teubner Series in Computer Science, 1987.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.