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

메뉴 건너뛰기

Mathematical Notes of the Academy of Sciences of the USSR

Volumn 41, Issue 4, 1987, Pages 333-338

Lower bounds on the size of bounded depth circuits over a complete basis with logical addition

(1) Razborov, A A a

a STEKLOV MATHEMATICAL INSTITUTE (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26944478724 PISSN: 00014346 EISSN: 15738876 Source Type: Journal
DOI: 10.1007/BF01137685 Document Type: Article

Times cited : (345)

References (17)

1
- 0021370261
- Boolean functions requiring 3n network size
- (1984) Theor. Comput. Sci. , vol.28 , pp. 337-345
- Blum, N.¹

2
- 84934827128
- M. Furst, J. B. Saxe, and M. Sipser, “Parity, circuits, and the polynomial time hierarchy,” Proc. 22nd Ann. IEEE Symp. on Foundations of Computer Sci. (1981), pp. 260–270.

3
- 0002127588
- Parity, circuits, and the polynomial time hierarchy
- (1984) Math. Syst. Theory , vol.17 , pp. 13-27
- Furst, M.¹ Saxe, J.B.² Sipser, M.³

4
- 0002970176
- Ϝ1¹ formulas on finite structures
- (1983) Ann. Pure Appl. Logic , vol.24 , pp. 1-48
- Ajtai, M.¹

5
- 84934818074
- L. G. Valiant, “Exponential lower bounds for restricted monotone circuits,” Proc. 15th Ann. ACM Symp. on Theory of Comp. (1983), pp. 110–187.

6
- 84934835932
- R. Boppana, “Threshold functions and bounded depth monotone circuits,” Proc. 16th Ann. ACM Symp. on Theory of Comp. (1984), pp. 475–479.

7
- 84934826926
- M. Klaw, W. Paul, N. Pippenger, and M. Yannakakis, “On monotone formulas with restricted depth,” Proc. 16th Ann. ACM Symp. on Theory of Comp. (1984), pp. 475–479.

8
- 84934816603
- A. Yao, “Separating the polynomial-time hierarchy by oracles,” Proc. 26th Ann. IEEE Symp. on Foundations of Computer Science (1985), pp. 1–10.

9
- 84934797249
- J. Hastad, “Almost-optimal lower bounds for small depth circuits,” Preprint (1985).

10
- 0000574714
- Lower bounds on monotone complexity of some Boolean functions
- (1985) Dokl. Akad. Nauk SSSR , vol.281 , Issue.4 , pp. 789-801
- Razborov, A.A.¹

11
- 0037909270
- Lower bounds on monotone complexity of a logical permanent
- (1985) Mat. Zametki , vol.37 , Issue.6 , pp. 887-900
- Razborov, A.A.¹

12
- 0041050442
- On a method of obtaining lower complexity bounds of individual monotone functions
- (1985) Dokl. Akad. Nauk SSSR , vol.282 , Issue.5 , pp. 1033-1037
- Andreev, A.E.¹

13
- 84934856341
- N. Alon and R. B. Boppana, “The monotone circuit complexity of Boolean functions,” Preprint (1985).

14
- 84934849683
- Lower bounds for algebraic complexity of computations
- Nauka, Leningrad
- (1982) Computational Complexity Theory, I [in Russian], Zapiski LOMI, Vol. 188
- Grigor'ev¹

15
- 84914722394
- Lower bounds on the size of bounded depth circuits over the basis { &, ∀, ⊕}
- (1986) Usp. Math. Nauk , vol.41 , Issue.4 , pp. 219-220
- Razborov, A.A.¹

16
- 84934845105
- Univ. of California, Berkeley
- (1986) Algebraic methods in the theory of lower bounds for Boolean circuit complexity
- Smolensky, R.¹

17
- 84934815588
- M. Paterson, “Bounded depth circuits over {+, λ},” Preprint, Univ. of Warwick (1986).

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