"A Note on the Parallel Complexity of Computing the Rank of Order n Matrices."

Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier (1980)

> Home

Details and statistics

DOI: 10.1016/0020-0190(80)90042-3

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/IbarraMR80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/IbarraMR80
Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier:
A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. Inf. Process. Lett. 11(4/5): 162 (1980)

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.