"The Black-Box Query Complexity of Polynomial Summation."

Ali Juma et al. (2009)

> Home

Details and statistics

DOI: 10.1007/S00037-009-0263-7

access: closed

type: Journal Article

metadata version: 2023-06-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/JumaKRS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/JumaKRS09
Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka:
The Black-Box Query Complexity of Polynomial Summation. Comput. Complex. 18(1): 59-79 (2009)

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.