Pages that link to "Software:Unique games conjecture"
From HandWiki
The following pages link to Software:Unique games conjecture:
Displayed 38 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Analysis of Boolean functions (← links)
- Dense subgraph (← links)
- Diffie–Hellman problem (← links)
- Discrete logarithm (← links)
- Field with one element (← links)
- Lattice problem (← links)
- Learning with errors (← links)
- Ring learning with errors (← links)
- Approximation algorithm (← links)
- Hardness of approximation (← links)
- List of conjectures (← links)
- P versus NP problem (← links)
- Betweenness (← links)
- Feedback arc set (← links)
- Minimum k-cut (← links)
- Short integer solution problem (← links)
- Semidefinite programming (← links)
- Planted clique (← links)
- Feedback vertex set (← links)
- Vertex cover (← links)
- Maximum cut (← links)
- Frankl–Rödl graph (← links)
- Constraint satisfaction problem (← links)
- List of unsolved problems in computer science (← links)
- Phi-hiding assumption (← links)
- Computational hardness assumption (← links)
- Decision Linear assumption (← links)
- Quadratic residuosity problem (← links)
- Higher residuosity problem (← links)
- Vertex cover in hypergraphs (← links)
- Decisional Diffie–Hellman assumption (← links)
- Integer factorization (← links)
- Sub-group hiding (← links)
- XDH assumption (← links)
- RSA problem (← links)
- Template:Computational hardness assumptions (← links)
- Biography:Subhash Khot (← links)
- Biography:Ryan O'Donnell (computer scientist) (← links)