"On the complexity of some problems in algorithmic algebraic number theory."

Christoph Thiel (1995)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2021-07-17

- view
  authority control:
- export record
  dblp key:
  - phd/dnb/Thiel95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/dnb/Thiel95
Christoph Thiel:
On the complexity of some problems in algorithmic algebraic number theory. Saarland University, Germany, 1995, pp. 1-129

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.