SCOPUS 정보 검색 플랫폼

Volumn 74, Issue 3, 2008, Pages 358-363

Proving SAT does not have small circuits with an application to the two queries problem

Author keywords

SAT; Small circuits; Two queries

Indexed keywords

FAILURE ANALYSIS; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; QUERY LANGUAGES;

CIRCUIT FAILURE; POLYNOMIAL-TIME HIERARCHY; SMALL CIRCUITS;

DIGITAL CIRCUITS;

EID: 38149052235 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/j.jcss.2007.06.017 Document Type: Article

Times cited : (12)

References (12)

1
- 0001656946
- A relationship between difference hierarchies and relativized polynomial hierarchies
- Beigel R., Chang R., and Ogihara M. A relationship between difference hierarchies and relativized polynomial hierarchies. Math. Systems Theory 26 3 (1993) 291-310
- (1993) Math. Systems Theory , vol.26 , Issue.3 , pp. 291-310
- Beigel, R.¹ Chang, R.² Ogihara, M.³

2
- 0030165961
- Oracles and queries that are sufficient for exact learning
- Bshouty N., Cleve R., Gavaldà R., Kannan S., and Tamon C. Oracles and queries that are sufficient for exact learning. J. Comput. System Sci. 52 3 (1996) 421-433
- (1996) J. Comput. System Sci. , vol.52 , Issue.3 , pp. 421-433
- Bshouty, N.¹ Cleve, R.² Gavaldà, R.³ Kannan, S.⁴ Tamon, C.⁵

3
- 0032597156
- Two queries
- Buhrman H., and Fortnow L. Two queries. J. Comput. System Sci. 59 2 (1999) 182-194
- (1999) J. Comput. System Sci. , vol.59 , Issue.2 , pp. 182-194
- Buhrman, H.¹ Fortnow, L.²

4
- 85128126270
- NP, in: Proceedings of the 42nd IEEE Conference on Foundations of Computer Science FOCS, 2001, pp. 620-629

5
- 0000560640
- More on BPP and the polynomial-time hierarchy
- Canetti R. More on BPP and the polynomial-time hierarchy. Inform. Process. Lett. 57 5 (1996) 237-241
- (1996) Inform. Process. Lett. , vol.57 , Issue.5 , pp. 237-241
- Canetti, R.¹

6
- 0030130026
- The Boolean hierarchy and the polynomial hierarchy, A closer connection
- Chang R., and Kadin J. The Boolean hierarchy and the polynomial hierarchy, A closer connection. SIAM J. Comput. 25 2 (1996) 340-354
- (1996) SIAM J. Comput. , vol.25 , Issue.2 , pp. 340-354
- Chang, R.¹ Kadin, J.²

7
- 0003691180
- Cambridge University Press, New York
- Goldreich O. Foundations of Cryptography, vol. 1 (2001), Cambridge University Press, New York
- (2001) Foundations of Cryptography, vol. 1
- Goldreich, O.¹

8
- 38249043088
- Random generation of combinatorial structures from a uniform distribution
- Jerrum M., Valiant L., and Vazirani V. Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43 (1986) 169-188
- (1986) Theoret. Comput. Sci. , vol.43 , pp. 169-188
- Jerrum, M.¹ Valiant, L.² Vazirani, V.³

9
- 0024134606
- The polynomial-time hierarchy collapses if the Boolean hierarchy collapses
- Kadin J. The polynomial-time hierarchy collapses if the Boolean hierarchy collapses. SIAM J. Comput. 17 (1988) 1263-1282
- (1988) SIAM J. Comput. , vol.17 , pp. 1263-1282
- Kadin, J.¹

10
- 0024020188
- The complexity of optimization problems
- Krentel M. The complexity of optimization problems. J. Comput. System Sci. 36 (1988) 490-509
- (1988) J. Comput. System Sci. , vol.36 , pp. 490-509
- Krentel, M.¹

11
- 0032356378
- Symmetric alternation captures BPP
- Russell A., and Sundaram R. Symmetric alternation captures BPP. J. Comput. Complexity 7 2 (1998) 152-162
- (1998) J. Comput. Complexity , vol.7 , Issue.2 , pp. 152-162
- Russell, A.¹ Sundaram, R.²

12
- 38149138904
- K. Wagner, Number-of-query hierarchies, Technical Report 158, Institut für Mathematik, Universitat Augsburg, October 1987

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