"Effizientes Verifizieren co-NP-vollständiger Probleme am Beispiel ..."

Frank Schädlich (2004)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2021-07-17

- view
  - electronic edition @ tu-chemnitz.de
  - electronic edition @ nbn-resolving.org
  authority control:
- export record
  dblp key:
  - phd/de/Schadlich2004
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/de/Schadlich2004
Frank Schädlich:
Effizientes Verifizieren co-NP-vollständiger Probleme am Beispiel zufälliger 4-SAT-Formeln und uniformer Hypergraphen. Chemnitz University of Technology, Germany, 2004, pp. 1-194

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.