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

메뉴 건너뛰기

Computational Complexity

Volumn 4, Issue 4, 1994, Pages 339-349

Perceptrons, PP, and the polynomial hierarchy

(1) Beigel, Richard a

a Dept of Computer Science ^* (United States)

Author keywords

Perceptron; polynomial hierarchy; PP; Subject classifications: 68Q15; weight

Indexed keywords

EID: 0038384210 PISSN: 10163328 EISSN: 14208954 Source Type: Journal
DOI: 10.1007/BF01263422 Document Type: Article

Times cited : (85)

References (22)

1
- 84934433862
- E. Allender, A note on the power of threshold circuits. In Proceedings of the 30th Ann. Symp. Found. Comput. Sci., 1989, 580–584.

2
- 84934433867
- E. Allender and U. Hertrampf, Depth reduction for circuits of unbounded fanin. Inform. and Comput.108 (1994). To appear.

3
- 84934433868
- J. Aspnes, R. Beigel, M. Furst, and S. Rudich, The expressive power of voting polynomials. In Proceedings of the 23rd Ann. ACM Symp. Theor. Comput., 1991, 402–409. A revised version is to appear in Combinatorica.

4
- 84934433869
- R. Beigel and J. Tarui, On ACC. This Journal.

5
- 0025791380
- Probabilistic polynomial time is closed under parity reductions
- (1991) Inform. Process. Lett. , vol.37 , Issue.2 , pp. 91-94
- Beigel, R.¹ Hemachandra, L.A.² Wechsung, G.³

6
- 84934433870
- R. Beigel, N. Reingold, and D. Spielman, The perceptron strikes back. In Proceedings of the 6th Ann. Conf. Structure in Complexity Theory, 1991b, 286–291.

7
- 84934433863
- R. Beigel, N. Reingold, and D. Spielman, PP is closed under intersection. J. Comput. System Sci.48 (1994). To appear.

8
- 0026123004
- On truth table reducibility to SAT
- (1991) Inform. and Comput. , vol.91 , Issue.1 , pp. 86-102
- Buss, S.R.¹ Hay, L.E.²

9
- 84934433864
- E. W. Cheney, Approximation Theory. McGraw-Hill, 1966.

10
- 0001952270
- Schwankung von polynomen zwischen gitterpunkten
- (1964) Math. Z. , vol.86 , pp. 41-44
- Ehlich, H.¹ Zeller, K.²

11
- 51249163193
- Separating PH from PP by relativization
- (1992) Acta Math. Sinica , vol.8 , Issue.3 , pp. 329-336
- Fu, B.¹

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

13
- 84934433865
- T. Gundermann, N. Nasser, and G. Wechsung, A survey of counting classes. In Proceedings of the 5th Ann. Conf. Structure in Complexity Theory. IEEE Computer Society Press, 1990, 140–153.

14
- 84934433866
- Technical Report CUCS-372-88, Columbia Dept. of Computer Science, New York, NY
- (1988) On the power of probabilistic polynomial time:P^NP[log]⊆PP
- Hemachandra, L.¹ Wechsung, G.²

15
- 0004162546
- Holt, Rinehart and Winston, New York
- (1966) Approximation of Functions
- Lorentz, G.G.¹

16
- 0004290881
- MIT Press, Cambridge, MA
- (1988) Perceptrons
- Minsky, M.L.¹ Papert, S.A.²

17
- 0003938791
- Birkhäuser-Verlag, Berlin
- (1972) Problems and Theorems in Analysis
- Pólya, G.¹ Szegö, G.²

18
- 0000977087
- A comparison of uniform approximations on an interval and a finite subset thereof
- (1966) SIAM Journal on Numerical Analysis , vol.3 , Issue.2 , pp. 311-320
- Rivlin, T.J.¹ Cheney, E.W.²

19
- 0027591463
- Probabilistic polynomials, AC⁰ functions, and the polynomial-time hierarchy
- (1993) Theoret. Comput. Sci. , vol.113 , pp. 167-183
- Tarui, J.¹

20
- 0026239342
- PP is as hard as the polynomial-time hierarchy
- (1991) SIAM J. Comput. , vol.20 , Issue.5 , pp. 865-877
- Toda, S.¹

21
- 0001594533
- Counting classes are at least as hard as the polynomial-time hierarchy
- (1992) SIAM Journal on Computing , vol.21 , Issue.2 , pp. 316-328
- Toda, S.¹ Ogiwara, M.²

22
- 84934433871
- A. C.-C. Yao, On ACC and threshold circuits. In Proceedings of the 31st Ann. Symp. Found. Comput. Sci., 1990, 619–627.

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