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

메뉴 건너뛰기

Random Structures & Algorithms

Volumn 4, Issue 2, 1993, Pages 135-150

Shrinkage of de Morgan formulae under restriction

(2) Paterson, Michael S a Zwick, Uri b

a UNIVERSITY OF WARWICK (United Kingdom)

b TEL AVIV UNIVERSITY (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84990671465 PISSN: 10429832 EISSN: 10982418 Source Type: Journal
DOI: 10.1002/rsa.3240040203 Document Type: Article

Times cited : (55)

References (19)

1
- 0040812627
- On a method for obtaining more than quadratic effective lower bounds for the complexity of π‐schemes
- (in Russian)
- (1987) Vestn. Mosk. Univ. Mat. , vol.42 , Issue.1 , pp. 70-73
- Andreev, A.E.¹

2
- 84990658823
- English translation in, 63–66
- (1987) Moscow Univ. Math. Bull. , vol.42 , Issue.1

3
- 84990678266
- Amplification of probablistic Boolean formulas
- JAI Press, Greenwich, CT
- Advances in Computer Research, Vol. 5: Randommness and Computation
- Boppanna, R.B.¹

4
- 0004183551
- Academic Press, New York
- (1988) The Complexity of Boolean Networks
- Dunne, P.E.¹

5
- 84990637480
- On the shirinkage exponent for read‐once formulae, manuscript.
- Håstad, J.¹ Razborov, A.² Yao, A.³

6
- 0010842067
- Complexity of the realization of a linear function in the class of π‐circuits
- (in Russian)
- (1971) Mat. Zametki , vol.9 , pp. 35-40
- Khrapchenko, V.M.¹

7
- 84990724037
- English translation in, 21–23
- (1971) Math. Notes Acad. Sci. USSR , vol.9

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

9
- 84990735950
- English translation in, 474–479
- (1971) Math. Notes Acad. Sci. USSR , vol.10

10
- 0013546339
- Complexity of formula realization of functions of logical algebra
- (in Russian)
- (1962) Prob. Kibern. , vol.3 , pp. 61-80
- Lupanov, O.B.¹

11
- 84990735946
- English translation in, 782–811
- (1962) Probl. Cyb. , vol.3

12
- 84990716822
- The effect of random restrictions on formula size, preprint
- A revised version appears in
- (1993) Random Structures and Algorithms , vol.4 , pp. 121-133
- Impagliazzo, R.¹ Nisan, N.²

13
- 0026384506
- Shrinkage of de Morgan formulae under restriction, Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science
- (1991) , pp. 324-333
- Paterson, M.S.¹ Zwick, U.²

14
- 0001908236
- The number of two‐terminal series‐parallel networks
- (1942) J. Math. Phys. , vol.21 , pp. 155-171
- Riordan, J.¹ Shannon, C.E.²

15
- 0039824684
- Realizations of linear functions by formulas using +, *, –
- (in Russian)
- (1961) Dokl. Akad. Nauk SSSR , vol.136 , pp. 553-555
- Subbotovskaya, B.A.¹

16
- 84990671739
- English translation in, 110–112
- (1961) Sov. Math. Dokl. , vol.2

17
- 0000378392
- Short monotone formulae for the majority function
- (1984) J. Algorithms , vol.5 , pp. 363-366
- Valiant, L.G.¹

18
- 84990708550
- The complexity of Boolean functions, Wiley‐Teubner Series in Computer Science
- (1987)
- Wegener, I.¹

19
- 0026106054
- An extension of Khrapchenko's theorem
- (1991) Inf. Process. Lett. , vol.37 , pp. 215-217
- Zwick, U.¹

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