Pages that link to "Item:Q2488898"
From MaRDI portal
The following pages link to Reductions, completeness and the hardness of approximability (Q2488898):
Displaying 20 items.
- A survey on the structure of approximation classes (Q458503) (← links)
- Abstract reduction systems and idea of Knuth-Bendix completion algorithm (Q467811) (← links)
- Survey of polynomial transformations between NP-complete problems (Q555184) (← links)
- Hardness results for homology localization (Q633215) (← links)
- Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← links)
- Continuous reductions among combinatorial optimization problems (Q1112622) (← links)
- Computational depth and reducibility (Q1334655) (← links)
- Completeness and reduction in algebraic complexity theory (Q1567446) (← links)
- Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
- Nonuniform reductions and NP-completeness (Q2158296) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- (Q2778836) (← links)
- Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem (Q2835671) (← links)
- \(L^1\)-computability, layerwise computability and Solovay reducibility (Q2851186) (← links)
- On notions of computability-theoretic reduction between Π21 principles (Q3186057) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- (Q4530147) (← links)
- On sparseness and Turing reducibility over the reals (Q4916198) (← links)
- ON RELATIVE COMPLETE REDUCIBILITY (Q5108051) (← links)
- Computing and Combinatorics (Q5717021) (← links)
