"Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations."

Dima Grigoriev (1997)

> Home

Details and statistics

DOI: 10.1006/JCOM.1997.0436

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/Grigoriev97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/Grigoriev97
Dima Grigoriev:
Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations. J. Complex. 13(1): 50-64 (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.