Hardness of constraint satisfaction and hypergraph coloring - constructions of probabilistically checkable proofs with perfect completeness
- Författare
- Sangxia Huang
- (Sangxia Huang.)
- Genre
- theses
- Språk
- Engelska
| Förlag | År | Ort | Om boken | ISBN |
|---|---|---|---|---|
| Computer Science and Communication, KTH Royal Institute of Technology | 2015 | Sverige, Stockholm | viii, 142 sidor. (PDF) | |
| Computer Science and Communication, KTH Royal Institute of Technology | 2015 | Sverige, Stockholm | viii, 142 sidor. | 978-91-7595-633-6 |