"The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted ..."

Volker Bosserhoff (2008)

> Home

Details and statistics

DOI: 10.3217/JUCS-014-06-0938

access: open

type: Journal Article

metadata version: 2023-09-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jucs/Bosserhoff08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jucs/Bosserhoff08
Volker Bosserhoff:
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration. J. Univers. Comput. Sci. 14(6): 938-955 (2008)

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.