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

메뉴 건너뛰기

Random Structures & Algorithms

Volumn 4, Issue 2, 1993, Pages 121-133

The effect of random restrictions on formula size

(2) Impagliazzo, Russell a Nisan, Noam b

a UNIVERSITY OF CALIFORNIA (United States)

b HEBREW UNIVERSITY OF JERUSALEM (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

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

Times cited : (53)

References (5)

1
- 0346084217
- On a method for obtaining more than quadratic effective lower bounds for the complexity of π‐schemes
- (1987) Moscow Univ. Math. Bull. , vol.42 , Issue.1 , pp. 63-66
- Andreev, A.E.¹

2
- 84990711970
- The complexity of finite functions, Handbook of Theoretical Computer Science.
- Boppana, R.¹ Sipser, M.²

3
- 34250466566
- A method of determining lower bounds for the complexity of II‐schemes
- (1971) Math. Notes Acad. Sci. USSR. , vol.10 , pp. 474-479
- Khrapchenko, V.M.¹

4
- 84990671465
- Shrinkage of de Morgan formulae under restriction
- (1993) Random Structures and Algorithms , vol.4 , pp. 135-150
- Paterson, M.S.¹ Zwick, U.²

5
- 0040812632
- Realizations of linear functions by formulas using +, *, ‐
- (1961) Sov. Math. Doklady , vol.2 , pp. 110-112
- Subbotovskaya, B.A.¹

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