"Linear Tangent Algorithms and Lower Bounds for the Complexity of Computation."

Jacques Morgenstern (1974)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2019-07-26

- no documents available
- export record
  dblp key:
  - conf/ifip/Morgenstern74
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifip/Morgenstern74
Jacques Morgenstern:
Linear Tangent Algorithms and Lower Bounds for the Complexity of Computation. IFIP Congress 1974: 682-684

a service of

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.