메뉴 건너뛰기




Volumn 28, Issue 2, 1998, Pages 637-651

Query order

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

EID: 0032107996     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796297632     Document Type: Article
Times cited : (11)

References (2)
  • 1
    • 85038069289 scopus 로고    scopus 로고
    • Modulo Information from Nonadaptive Queries to NP
    • Electronic Colloquium on Computational Complexity, Trier, Germany, Jan.
    • M. AGRAWAL, R. BEIGEL, AND T. THIERAUF, Modulo Information from Nonadaptive Queries to NP, Tech. Report 90-001, Electronic Colloquium on Computational Complexity, Trier, Germany, Jan. 1996.
    • (1996) Tech. Report 90-001
    • Agrawal, M.1    Beigel, R.2    Thierauf, T.3


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