Pages that link to "Item:Q2817610"
From MaRDI portal
The following pages link to Improved non-approximability results (Q2817610):
Displayed 17 items.
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Label placement by maximum independent set in rectangles (Q1276946) (← links)
- Compact location problems (Q1391322) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- Algebraic testing and weight distributions of codes. (Q1874387) (← links)
- Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Simulating BPP using a general weak random source (Q1923854) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2) (Q3541815) (← links)
- On point covers of \(c-\)oriented polygons (Q5941498) (← links)
- The asymmetric median tree. --- A new model for building consensus trees (Q5961632) (← links)