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

메뉴 건너뛰기

Journal of Computer and System Sciences

Volumn 16, Issue 2, 1978, Pages 168-184

NP-Complete decision problems for binary quadratics

(2) Manders, Kenneth L a Adleman, Leonard b

a UNIVERSITY OF CALIFORNIA (United States)

b MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041154689 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/0022-0000(78)90044-2 Document Type: Article

Times cited : (71)

References (18)

1
- 84909457907
- Number Theoretic Aspects of Computational Complexity
- 11th ed., University of California, Berkeley
- (1976) Ph.D. Dissertation
- Adleman¹

2
- 85068067569
- The computational complexity of decision procedures for polynomials
- IEEE, New York
- (1975) 16th Annual IEEE Symposium on Foundations of Computer Science , pp. 169-177
- Adleman¹ Manders²

3
- 85068048771
- Diophantine complexity
- IEEE, New York
- (1976) 17th Annual IEEE Symposium on Foundations of Computer Science , pp. 81-88
- Adleman¹ Manders²

4
- 0000374126
- Contributions to the theory of Diophantine equations I On the representation of integers by binary forms
- (1967) Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences , vol.263 , pp. 173-191
- Baker¹

5
- 0004250554
- Cambridge Univ. Press
- (1975) Transcendental Number Theory
- Baker¹

6
- 85059770931
- The complexity of theorem-proving procedures
- (1971) Conf. Rec. 3rd ACM Symposium on Theory of Computing , pp. 151-158
- Cook¹

7
- 0003766834
- Oxford Univ. Press (Clarendon), London
- (1938) An Introduction to the Theory of Numbers
- Hardy¹ Wright²

8
- 0001946992
- Mathematische Probleme: Vortrag gehalten auf dem internationalen MathematikerKongress zu Paris, 1900
- (1900) Nachr. Akad. Wiss. Göttingen, Math.-Phys. Kl. II , pp. 253-297
- Hilbert¹

9
- 0003037529
- Reducibility among combinatorial problems
- R.N. Miller, J.W. Thatcher, Plenum, New York
- (1972) Complexity of Computer Computation , pp. 85-104
- Karp¹

10
- 0042386016
- Note sur la limite du nombre des divisions dans la recherche du plus grand commun diviseur …
- (1844) C. R. Acad. Sci. Paris Sér. A-B , vol.19 , pp. 867-869
- Lamé¹

11
- 0003043273
- Enumerable sets are Diophantine
- (Russian)
- (1970) Dokl. Akad. Nauk SSSR , vol.191 , pp. 279-282
- Matijasevic¹

12
- 0041919058
- Reduction of an arbitrary Diophantine equation to one in 13 unknowns
- (1975) Acta Arith. , vol.27 , pp. 521-553
- Matijasevic¹ Robinson²

13
- 84916005787
- Y. Matijasevic, private communication.

14
- 84909577890
- 11th ed., University of California, Berkeley
- (1975) Ph.D. Dissertation
- Miller¹

15
- 0017217375
- Riexnann's hypothesis and tests for primality
- (1976) J. Comput. System Sci. , vol.13 , pp. 300-317
- Miller¹

16
- 0004170086
- Wiley, New York
- (1972) An Introduction to the Theory of Numbers
- Niven¹ Zuckerman²

17
- 0011521703
- Every prime has a succinet certificate
- (1975) SIAM Journal on Computing , vol.4 , pp. 214-220
- Pratt¹

18
- 84941462766
- Über Annäherungswerte algebraischer Zahlen
- (1909) J. Reine Angew. Math. , vol.135 , pp. 284-305
- Thus¹

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