13 results on '"Lars Engebretsen"'
Search Results
2. Three-Query PCPs with Perfect Completeness over non-Boolean Domains.
3. Inapproximability Results for Equations over Finite Groups.
4. Is Constraint Satisfaction Over Two Variables Always Easy?
5. Derandomized dimensionality reduction with applications.
6. Approximation Hardness of TSP with Bounded Metrics.
7. Using easy optimization problems to solve hard ones.
8. The Non-approximability of Non-Boolean Predicates.
9. Clique Is Hard to Approximate within n1-o(1).
10. An Explicit Lower Bound for TSP with Distances One and Two.
11. A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p.
12. Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems.
13. Harmonic broadcasting is optimal.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.