"Complexity Lower Bounds for Approximation Algebraic Computation Trees."

Felipe Cucker, Dima Grigoriev (1999)

> Home

Details and statistics

DOI: 10.1006/JCOM.1999.0519

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/CuckerG99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/CuckerG99
Felipe Cucker, Dima Grigoriev:
Complexity Lower Bounds for Approximation Algebraic Computation Trees. J. Complex. 15(4): 499-512 (1999)

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.