책 이미지
eBook 미리보기
책 정보
· 제목 : Hardness of Approximation Between P and NP (Paperback)
· 분류 : 외국도서 > 컴퓨터 > 컴퓨터 공학
· ISBN : 9781947487208
· 쪽수 : 319쪽
· 출판일 : 2019-06-07
· 분류 : 외국도서 > 컴퓨터 > 컴퓨터 공학
· ISBN : 9781947487208
· 쪽수 : 319쪽
· 출판일 : 2019-06-07
목차
- Preface
- Part I: Overview
- The Frontier of Intractability
- Preliminaries
- Part II: Communication Complexity
- Communication Complexity of Approximate Nash Equilibrium
- Brouwer's Fixed Point
- Part III: PPAD
- PPAD-Hardness of Approximation
- The Generalized Circuit Problem
- Many-Player Games
- Bayesian Nash Equilibrium
- Market Equilibrium
- CourseMatch
- Part IV: Quasi-Polynomial Time
- Birthday Repetition
- Densest k-Subgraph
- Community Detection
- VC and Littlestone's Dimensions
- Signaling
- Part V: Approximate Nash Equilibrium
- 2-Player Approximate Nash Equilibrium
- References
- Index
- Author Biography
