DocumentCode
1683393
Title
Inapproximability - some history and some open problems
Author
Håstad, Johan
Author_Institution
R. Inst. of Technol., Stockholm, Sweden
fYear
2003
Firstpage
265
Lastpage
266
Abstract
The purpose of this talk is to give an overview of the status of some problems in approximability.
Keywords
approximation theory; computability; computational complexity; optimisation; probability; theorem proving; Max-3Sat; NP-complete problem; inapproximability problem; optimization problem; polynomial time approximation algorithm; probability; proof system; satisfiability; Approximation algorithms; Computational complexity; History; NP-complete problem; Optimized production technology; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 2003. Proceedings. 18th IEEE Annual Conference on
ISSN
1093-0159
Print_ISBN
0-7695-1879-6
Type
conf
DOI
10.1109/CCC.2003.1214426
Filename
1214426
Link To Document