SCOPUS 정보 검색 플랫폼

Volumn 62, Issue 4, 2001, Pages 589-607

Linear-consistency testing

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GRAPH THEORY; MAPPING; PROBABILISTIC LOGICS;

LINEAR CONSISTENCY;

COMPUTATION THEORY;

EID: 0035360610 PISSN: 00220000 EISSN: None Source Type: Journal
DOI: 10.1006/jcss.2001.1747 Document Type: Article

Times cited : (10)

References (15)

1
- 0032058198
- Proof verification and the hardness of approximation problems
- (1998) J, Assoc. Comput. Mach. , vol.45 , pp. 501-555
- Arora, S.¹ Lund, C.² Motwani, R.³ Sudan, M.⁴ Szegedy, M.⁵

2
- 0031651077
- Probabilistic checking of proofs: A new characterization of NP
- (1998) J. Assoc. Comput. Mach. , vol.45 , pp. 70-122
- Arora, S.¹ Safra, S.²

4
- 0030289082
- Linearity testing in characteristic two
- (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 1781-1795
- Bellare, M.¹ Coppersmith, D.² Håstad, J.³ Kiwi, M.⁴ Sudan, M.⁵

5
- 0542423500
- Free bits, PCPs, and non-approximability - Towards tight results
- (1998) SIAM J. Comput. , vol.27 , pp. 804-915
- Bellare, M.¹ Goldreich, O.² Sudan, M.³

6
- 0027308413
- Efficient probabilistically checkable proofs and applications to approximation
- San Diego, California, 16-18 May
- (1993) Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing , pp. 294-304
- Bellare, M.¹ Goldwasser, S.² Lund, C.³ Russell, A.⁴

7
- 0029214558
- Designing programs that check their work
- (1995) J. Assoc. Comput. Mach. , vol.42 , pp. 269-291
- Blum, M.¹ Kannan, S.²

8
- 0000619172
- Self-testing/correcting with applications to numerical problems
- (1993) J. Comput. Sci. , vol.47 , pp. 549-595
- Blum, M.¹ Luby, M.² Rubinfeld, R.³

9
- 0030671781
- Some optimal inapproximabililty results
- El Paso, Texas, 4-6 May, Complete version accepted for publication in J. Assoc. Comput. Mach.
- (1997) Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing , pp. 1-10
- Håstad, J.¹

11
- 0001226672
- A parallel repetition theorem
- (1998) SIAM J. Comput. , vol.27 , pp. 763-803
- Raz, R.¹

12
- 0033718183
- A PCP characterization of NP with optimal amortized query complexity
- Portland, Oregon, 21-23 May
- (2000) Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing , pp. 181-190
- Samorodnitsky, A.¹ Trevisan, L.²

13
- 84958035151
- Positive linear programming, parallel approximation, and PCP's
- Lecture Notes on Computer Science, Springer-Verlag, Berlin
- (1996) Proceedings of the 4th European Symposium on Algorithms , vol.1136 , pp. 62-75
- Trevisan, L.¹

14
- 0031628722
- Recycling queries in PCPs and in linearity tests
- Dallas, Texas, 23-26 May
- (1998) Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing , pp. 299-308
- Trevisan, L.¹

15
- 0032266121
- Approximating algorithms for constraint satisfaction problems involving at most three variables per constraint
- (1998) Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms
- Zwick, U.¹

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