메뉴 건너뛰기




Volumn 284, Issue 1, 2002, Pages 53-66

Hardness results for neural network approximation problems

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS; PROBLEM SOLVING;

EID: 0037031025     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00057-3     Document Type: Conference Paper
Times cited : (22)

References (18)
  • 7
    • 0002192516 scopus 로고
    • Decision theoretic generalizations of the PAC model for neural net and other learning applications
    • (1992) Inform. and Comput. , vol.100 , Issue.1 , pp. 78-150
    • Haussler, D.1


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