메뉴 건너뛰기




Volumn 12, Issue 4, 1996, Pages 440-473

The complexity of definite elliptic problems with noisy data

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0030511596     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1996.0027     Document Type: Article
Times cited : (22)

References (13)
  • 8
    • 0030497285 scopus 로고    scopus 로고
    • Worst case complexity of problems with random information noise
    • to appear
    • 8. PLASKOTA, L. (1996), Worst case complexity of problems with random information noise, J. Complexity, to appear.
    • (1996) J. Complexity
    • Plaskota, L.1
  • 11
    • 0011517851 scopus 로고
    • The complexity of multivariate elliptic problems with analytic data
    • 11. WERSCHULZ, A. G. (1995), The complexity of multivariate elliptic problems with analytic data, J. Complexity 11, 154-173.
    • (1995) J. Complexity , vol.11 , pp. 154-173
    • Werschulz, A.G.1
  • 13
    • 0030511596 scopus 로고    scopus 로고
    • The complexity of indefinite elliptic problems with noisy data
    • to appear
    • 13. WERSCHULZ, A. G. (1996b), The complexity of indefinite elliptic problems with noisy data, J. Complexity, to appear.
    • (1996) J. Complexity
    • Werschulz, A.G.1


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