"The Complexity Types of Computable Sets."

Wolfgang Maass, Theodore A. Slaman (1992)

> Home

Details and statistics

DOI: 10.1016/0022-0000(92)90018-E

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/MaassS92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/MaassS92
Wolfgang Maass, Theodore A. Slaman:
The Complexity Types of Computable Sets. J. Comput. Syst. Sci. 44(2): 168-192 (1992)

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.