"The Complexity of Indefinite Elliptic Problems with Noisy Data."

Arthur G. Werschulz (1997)

> Home

Details and statistics

DOI: 10.1006/JCOM.1997.0456

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jc/Werschulz97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/Werschulz97
Arthur G. Werschulz:
The Complexity of Indefinite Elliptic Problems with Noisy Data. J. Complex. 13(4): 457-479 (1997)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.