"Hardness of Constraint Satisfaction and Hypergraph Coloring: Constructions ..."

Sangxia Huang (2015)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2025-01-13

- view
  - electronic edition @ kb.se
  authority control:
- export record
  dblp key:
  - phd/se/Huang15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/se/Huang15
Sangxia Huang:
Hardness of Constraint Satisfaction and Hypergraph Coloring: Constructions of Probabilistically Checkable Proofs with Perfect Completeness. KTH Royal Institute of Technology, Sweden, 2015

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.