Proof checking and non-approximability

From MaRDI portal

Revision as of 12:10, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4571889

Jump to:navigation, search

DOI10.1007/BFb0053014zbMath1401.68091MaRDI QIDQ4571889

Stefan Hougardy

Publication date: 3 July 2018

Published in: Lectures on Proof Verification and Approximation Algorithms (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Proof checking and non-approximability

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4571889&oldid=18716682"