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

메뉴 건너뛰기

Journal of Complexity

Volumn 13, Issue 1, 1997, Pages 50-64

Nearly sharp complexity bounds for multiprocessor algebraic computations

(1) Grigoriev, Dima a

a PENNSYLVANIA STATE UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031101385 PISSN: 0885064X EISSN: None Source Type: Journal
DOI: 10.1006/jcom.1997.0436 Document Type: Article

Times cited : (3)

References (17)

1
- 0020879158
- Lower bounds for algebraic computation trees
- 1983 86
- M. Ben-Or, 1983, Lower bounds for algebraic computation trees, Proc. ACM Symposium on Theoretical Computation, 1983, 80, 86.
- (1983) Proc. ACM Symposium on Theoretical Computation , pp. 80
- Ben-Or, M.¹

2
- 85029837057
- Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition
- New York/Berlin: Springer-Verlag. p. 134-183
- Collins G. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. Lecture Notes in Computer Science. 33:1975;Springer-Verlag, New York/Berlin. p. 134-183.
- (1975) Lecture Notes in Computer Science , vol.33
- Collins, G.¹

3
- 0001682069
- On the power of real Turing machines over binary inputs
- Cucker F., Grigoriev D. On the power of real Turing machines over binary inputs. SIAM J. Comput. 26:1997;243-254.
- (1997) SIAM J. Comput. , vol.26 , pp. 243-254
- Cucker, F.¹ Grigoriev, D.²

4
- 84957621752
- Parallel Arithmetic Computations: A Survey
- New York/Berlin: Springer-Verlag. p. 93-112
- von zur Gathen J. Parallel Arithmetic Computations: A Survey. Lecture Notes in Computer Science. 233:1986;Springer-Verlag, New York/Berlin. p. 93-112.
- (1986) Lecture Notes in Computer Science , vol.233
- Von Zur Gathen, J.¹

5
- 85025500424
- Complexity of deciding Tarski algebra
- Grigoriev D. Complexity of deciding Tarski algebra. J. Symbolic Comput. 5:1988;65-108.
- (1988) J. Symbolic Comput. , vol.5 , pp. 65-108
- Grigoriev, D.¹

6
- 0029513527
- Improved lower bound on testing membership to a polyhedron by algebraic decision trees
- 1995 265
- D. Grigoriev, M. Karpinski, N. Vorobjov, 1995, Improved lower bound on testing membership to a polyhedron by algebraic decision trees, Proc. IEEE FOCS, 1995, 258, 265.
- (1995) Proc. IEEE FOCS , pp. 258
- Grigoriev, D.¹ Karpinski, M.² Vorobjov, N.³

7
- 0029717340
- A lower bound for randomized algebraic decision trees
- 1996 619
- D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, 1996, A lower bound for randomized algebraic decision trees, Proc. ACM STOC, 1996, 612, 619.
- (1996) Proc. ACM STOC , pp. 612
- Grigoriev, D.¹ Karpinski, M.² Meyer Auf Der Heide, F.³ Smolensky, R.⁴

8
- 38249000122
- Point location in arrangements of hyperplanes
- Meiser S. Point location in arrangements of hyperplanes. Inform. and Comput. 106:1993;286-303.
- (1993) Inform. and Comput. , vol.106 , pp. 286-303
- Meiser, S.¹

9
- 0000401631
- Simulating probabilistic by deterministic algebraic computation trees
- Meyer auf der Heide F. Simulating probabilistic by deterministic algebraic computation trees. Theoret. Comput. Sci. 41:1985;325-330.
- (1985) Theoret. Comput. Sci. , vol.41 , pp. 325-330
- Meyer Auf Der Heide, F.¹

10
- 0024052926
- Fast algorithms forN
- Meyer auf der Heide F. Fast algorithms forN. J. Assoc. Comput. Machin. 35:1988;740-747.
- (1988) J. Assoc. Comput. Machin. , vol.35 , pp. 740-747
- Meyer Auf Der Heide, F.¹

11
- 84966260816
- On the Betti numbers of real varieties
- Milnor J. On the Betti numbers of real varieties. Proc. AMS. 15:1964;275-280.
- (1964) Proc. AMS , vol.15 , pp. 275-280
- Milnor, J.¹

12
- 0002392671
- Lower bounds for arithmetic networks
- Montana J., Pardo L. Lower bounds for arithmetic networks. Appl. Algebra in Eng., Commun. and Comput. 4:1993;1-24.
- (1993) Appl. Algebra in Eng., Commun. and Comput. , vol.4 , pp. 1-24
- Montana, J.¹ Pardo, L.²

13
- 0001933332
- Lower bounds for arithmetic network. II. Sum of Betti numbers
- Montana J., Morais J., Pardo L. Lower bounds for arithmetic network. II. Sum of Betti numbers. Appl. Algebra in Eng., Commun. and Comput. 7:1996;41-51.
- (1996) Appl. Algebra in Eng., Commun. and Comput. , vol.7 , pp. 41-51
- Montana, J.¹ Morais, J.² Pardo, L.³

14
- 0028092499
- Lower bounds for parallel linear programming and other problems
- 1994 644
- K. Mulmuley, 1994, Lower bounds for parallel linear programming and other problems, Proc, ACM Symposium on Theoretical Computation, 1994, 603, 644.
- (1994) Proc, ACM Symposium on Theoretical Computation , pp. 603
- Mulmuley, K.¹

15
- 0002943521
- Lower bounds for algebraic decision trees
- Steele M., Yao A. Lower bounds for algebraic decision trees. J. Algorithms. 3:1982;1-8.
- (1982) J. Algorithms , vol.3 , pp. 1-8
- Steele, M.¹ Yao, A.²

16
- 0027940782
- Decision tree complexity and Betti numbers
- 1994 624
- A. Yao, 1994, Decision tree complexity and Betti numbers, Proc. ACM Symposium Theory on Computation, 1994, 615, 624.
- (1994) Proc. ACM Symposium Theory on Computation , pp. 615
- Yao, A.¹

17
- 0003148287
- On the polyhedral decision problem
- Yao A., Rivest R. On the polyhedral decision problem. SIAM J. Comput. 9:1980;343-347.
- (1980) SIAM J. Comput. , vol.9 , pp. 343-347
- Yao, A.¹ Rivest, R.²

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