"Algorithms from Complexity Theory: Polynominal-Time Operations for Complex ..."

Lane A. Hemachandra (1990)

> Home

Details and statistics

DOI: 10.1007/3-540-52921-7_71

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sigal/Hemachandra90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigal/Hemachandra90
Lane A. Hemachandra:
Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets. SIGAL International Symposium on Algorithms 1990: 221-231

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.