상세정보
Export to Refworks부가기능
Approximation Algorithms, Hardness, and PCPs
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Approximation Algorithms, Hardness, and PCPs. |
| 개인저자 | Thiruvenkatachari, Devanathan. |
| 단체저자명 | New York University. Computer Science. |
| 발행사항 | [S.l.]: New York University., 2019. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2019. |
| 형태사항 | 144 p. |
| 기본자료 저록 | Dissertations Abstracts International 81-06B. Dissertation Abstract International |
| ISBN | 9781392766347 |
| 학위논문주기 | Thesis (Ph.D.)--New York University, 2019. |
| 일반주기 |
Source: Dissertations Abstracts International, Volume: 81-06, Section: B.
Advisor: Khot, Subhash. |
| 이용제한사항 | This item must not be sold to any third party vendors.This item must not be added to any third party search indexes. |
| 요약 | This thesis is a collection of theoretical results on the topic of approximationalgorithms and hardness of approximation. The results presented here use acombination of classical and modern techniques to achieve better approximationalgorithms and hardness results for some pivotal NP-hard problems and theirvariants. We study CSPs from a multi-objective point of view, with the goal ofsimultaneous optimization of multiple instances over the same set of variables,withMAX-CUT as the central focus. We provide an approximation algorithm thatis near optimal assuming the unique games conjecture. We also study PCPs andtheir role in hardness of approximation, and present a hardness result for 3-LINin the sub-constant soundness regime. Lastly, dictatorship testing is a propertytesting problem with significant applications in proving hardness results, andwe present an improvement on the soundness of the k-bit dictatorship test withperfect completeness. |
| 일반주제명 | Computer science. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
