Pages that link to "Hardness of approximation"
From HandWiki
The following pages link to Hardness of approximation:
Displayed 35 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Analysis of Boolean functions (← links)
- Computational problem (← links)
- Long code (mathematics) (← links)
- Probabilistically checkable proof (← links)
- Approximation algorithm (← links)
- Interactive proof system (← links)
- List of numerical analysis topics (← links)
- PCP theorem (← links)
- Ideal lattice cryptography (← links)
- K-minimum spanning tree (← links)
- Bipartite dimension (← links)
- Graph bandwidth (← links)
- Maximum common induced subgraph (← links)
- Clique cover (← links)
- Clique problem (← links)
- Ideal lattice (← links)
- Gadget (computer science) (← links)
- Partial word (← links)
- Clique (graph theory) (← links)
- Reduction (complexity) (← links)
- Biography:Teofilo F. Gonzalez (← links)
- Biography:Mihalis Yannakakis (← links)
- Biography:Rajeev Motwani (← links)
- Biography:Chris Umans (← links)
- Biography:Uriel Feige (← links)
- Biography:Carsten Lund (← links)
- Biography:Shuchi Chawla (← links)
- Biography:Sanjeev Khanna (← links)
- Biography:Johan Håstad (← links)
- Biography:Irit Dinur (← links)
- Biography:Oded Regev (computer scientist) (← links)
- Biography:Ryan O'Donnell (computer scientist) (← links)
- Software:Mahjong solitaire (← links)
- Software:Unique games conjecture (← links)
- Software:Tetris (← links)
