"Polynomial bescränkte nichtdeterministische Turingmaschinen und die ..."

Alex Häussler (1976)

> Home

Details and statistics

DOI: 10.1007/3-540-07805-3_3

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ac/Haussler76
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ac/Haussler76
Alex Häussler:
Polynomial bescränkte nichtdeterministische Turingmaschinen und die Vollständigkeit des aussagelogischen Erfüllungsproblems. Komplexität von Entscheidungsproblemen 1976 1976: 20-35

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.