"On some direct encodings of nondeterministic Turing machines operating in ..."

Zvi Galil (1974)

> Home

Details and statistics

DOI: 10.1145/1811129.1811131

access: closed

type: Journal Article

metadata version: 2021-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/sigact/Galil74
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigact/Galil74
Zvi Galil:
On some direct encodings of nondeterministic Turing machines operating in polynomial time into p-complete problems. SIGACT News 6(1): 19-24 (1974)

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.