"Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT."

Zenon Sadowski (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-58741-7_34

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cie/Sadowski17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cie/Sadowski17
Zenon Sadowski:
Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT. CiE 2017: 364-374

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.